./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe009_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe009_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:42:05,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:42:05,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:42:05,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:42:05,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:42:05,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:42:05,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:42:05,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:42:05,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:42:05,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:42:05,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:42:05,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:42:05,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:42:05,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:42:05,266 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:42:05,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:42:05,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:42:05,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:42:05,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:42:05,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:42:05,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:42:05,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:42:05,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:42:05,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:42:05,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:42:05,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:42:05,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:42:05,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:42:05,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:42:05,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:42:05,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:42:05,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:42:05,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:42:05,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:42:05,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:42:05,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:42:05,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:42:05,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:42:05,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:42:05,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:42:05,271 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:42:05,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:42:05,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:42:05,272 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:42:05,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:42:05,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:42:05,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:42:05,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:42:05,509 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:42:05,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2024-06-27 22:42:06,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:42:06,827 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:42:06,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2024-06-27 22:42:06,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954dab4a6/dc6277ff0ab042269bdea1f35bc99e0a/FLAGfedfece5b [2024-06-27 22:42:06,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954dab4a6/dc6277ff0ab042269bdea1f35bc99e0a [2024-06-27 22:42:06,871 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:42:06,871 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:42:06,872 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/safe009_power.opt.yml/witness.yml [2024-06-27 22:42:06,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:42:06,952 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:42:06,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:42:06,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:42:06,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:42:06,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:42:06" (1/2) ... [2024-06-27 22:42:06,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2819e7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:42:06, skipping insertion in model container [2024-06-27 22:42:06,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:42:06" (1/2) ... [2024-06-27 22:42:06,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5e0d1a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:42:06, skipping insertion in model container [2024-06-27 22:42:06,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:42:06" (2/2) ... [2024-06-27 22:42:06,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2819e7b4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:06, skipping insertion in model container [2024-06-27 22:42:06,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:42:06" (2/2) ... [2024-06-27 22:42:06,962 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:42:06,984 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:42:06,985 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$read_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x) - (long long )x$mem_tmp >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:42:06,985 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$read_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x) - (long long )x$mem_tmp >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:42:06,985 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$mem_tmp) + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$read_delayed) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$mem_tmp) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff0_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd2) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$r_buff1_thd3) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff0_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX$w_buff1_used) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$flush_delayed) - (long long )x$mem_tmp >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )x$mem_tmp) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x) - (long long )x$mem_tmp >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff0_used >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:42:06,986 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:42:06,986 INFO L106 edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1; [2024-06-27 22:42:07,026 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:42:07,156 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i[951,964] [2024-06-27 22:42:07,292 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:42:07,303 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:42:07,336 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i[951,964] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:42:07,476 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:42:07,502 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:42:07,503 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07 WrapperNode [2024-06-27 22:42:07,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:42:07,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:42:07,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:42:07,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:42:07,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,611 INFO L138 Inliner]: procedures = 175, calls = 260, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 780 [2024-06-27 22:42:07,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:42:07,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:42:07,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:42:07,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:42:07,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,648 INFO L175 MemorySlicer]: Split 221 memory accesses to 2 slices as follows [2, 219]. 99 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-06-27 22:42:07,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:42:07,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:42:07,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:42:07,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:42:07,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (1/1) ... [2024-06-27 22:42:07,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:42:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:42:07,707 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-27 22:42:07,724 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-27 22:42:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 22:42:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 22:42:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 22:42:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 22:42:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:42:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:42:07,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:42:07,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:42:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:42:07,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:42:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:42:07,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:42:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:42:07,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 22:42:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:42:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:42:07,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:42:07,738 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:42:07,878 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:42:07,880 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:42:08,787 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:42:08,788 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:42:11,179 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:42:11,180 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:42:11,180 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:42:11 BoogieIcfgContainer [2024-06-27 22:42:11,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:42:11,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:42:11,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:42:11,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:42:11,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:42:06" (1/4) ... [2024-06-27 22:42:11,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a91ccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:42:11, skipping insertion in model container [2024-06-27 22:42:11,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:42:06" (2/4) ... [2024-06-27 22:42:11,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a91ccee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:42:11, skipping insertion in model container [2024-06-27 22:42:11,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:42:07" (3/4) ... [2024-06-27 22:42:11,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a91ccee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:42:11, skipping insertion in model container [2024-06-27 22:42:11,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:42:11" (4/4) ... [2024-06-27 22:42:11,187 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2024-06-27 22:42:11,201 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:42:11,201 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:42:11,201 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:42:11,271 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:42:11,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:42:11,326 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-06-27 22:42:11,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:42:11,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-27 22:42:11,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:42:11,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-06-27 22:42:11,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:42:11,342 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;@658906de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:42:11,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:42:11,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:42:11,348 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:42:11,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:42:11,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:11,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:42:11,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:11,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1842605450, now seen corresponding path program 1 times [2024-06-27 22:42:11,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861800762] [2024-06-27 22:42:11,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:16,571 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-27 22:42:16,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861800762] [2024-06-27 22:42:16,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861800762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:16,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:16,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:42:16,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251144524] [2024-06-27 22:42:16,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:16,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:42:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:42:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:42:16,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2024-06-27 22:42:16,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:16,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:16,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2024-06-27 22:42:16,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:18,415 INFO L124 PetriNetUnfolderBase]: 4536/6532 cut-off events. [2024-06-27 22:42:18,416 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-06-27 22:42:18,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13143 conditions, 6532 events. 4536/6532 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 36077 event pairs, 2565 based on Foata normal form. 179/6176 useless extension candidates. Maximal degree in co-relation 13131. Up to 6507 conditions per place. [2024-06-27 22:42:18,451 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 50 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2024-06-27 22:42:18,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 247 flow [2024-06-27 22:42:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:42:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:42:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-27 22:42:18,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-06-27 22:42:18,462 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 93 transitions. [2024-06-27 22:42:18,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 247 flow [2024-06-27 22:42:18,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:42:18,466 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 124 flow [2024-06-27 22:42:18,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-27 22:42:18,470 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-06-27 22:42:18,470 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 124 flow [2024-06-27 22:42:18,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:18,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:18,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:18,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:42:18,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:18,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash -886634617, now seen corresponding path program 1 times [2024-06-27 22:42:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274893563] [2024-06-27 22:42:18,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:22,737 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-27 22:42:22,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:22,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274893563] [2024-06-27 22:42:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274893563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:22,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:42:22,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742206814] [2024-06-27 22:42:22,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:22,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:42:22,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:22,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:42:22,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:42:22,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 22:42:22,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:22,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:22,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 22:42:22,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:24,625 INFO L124 PetriNetUnfolderBase]: 5355/8309 cut-off events. [2024-06-27 22:42:24,626 INFO L125 PetriNetUnfolderBase]: For 1081/1086 co-relation queries the response was YES. [2024-06-27 22:42:24,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17820 conditions, 8309 events. 5355/8309 cut-off events. For 1081/1086 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 49041 event pairs, 3206 based on Foata normal form. 7/7788 useless extension candidates. Maximal degree in co-relation 17808. Up to 7609 conditions per place. [2024-06-27 22:42:24,663 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 66 selfloop transitions, 8 changer transitions 1/82 dead transitions. [2024-06-27 22:42:24,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 367 flow [2024-06-27 22:42:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:42:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:42:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-06-27 22:42:24,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6117021276595744 [2024-06-27 22:42:24,668 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 124 flow. Second operand 4 states and 115 transitions. [2024-06-27 22:42:24,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 367 flow [2024-06-27 22:42:24,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:42:24,670 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 189 flow [2024-06-27 22:42:24,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-06-27 22:42:24,671 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2024-06-27 22:42:24,671 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 189 flow [2024-06-27 22:42:24,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:24,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:24,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:24,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:42:24,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:24,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1715866422, now seen corresponding path program 1 times [2024-06-27 22:42:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:24,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692446081] [2024-06-27 22:42:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:29,491 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-27 22:42:29,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:29,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692446081] [2024-06-27 22:42:29,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692446081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:29,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:29,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:42:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863678265] [2024-06-27 22:42:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:29,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:42:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:42:29,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:42:29,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 22:42:29,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:29,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:29,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 22:42:29,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:31,310 INFO L124 PetriNetUnfolderBase]: 5360/8312 cut-off events. [2024-06-27 22:42:31,310 INFO L125 PetriNetUnfolderBase]: For 3248/3263 co-relation queries the response was YES. [2024-06-27 22:42:31,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19445 conditions, 8312 events. 5360/8312 cut-off events. For 3248/3263 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 49014 event pairs, 2836 based on Foata normal form. 15/7800 useless extension candidates. Maximal degree in co-relation 19430. Up to 7582 conditions per place. [2024-06-27 22:42:31,345 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 81 selfloop transitions, 11 changer transitions 2/101 dead transitions. [2024-06-27 22:42:31,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 497 flow [2024-06-27 22:42:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:42:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:42:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-06-27 22:42:31,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6127659574468085 [2024-06-27 22:42:31,347 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 189 flow. Second operand 5 states and 144 transitions. [2024-06-27 22:42:31,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 497 flow [2024-06-27 22:42:31,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 486 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 22:42:31,350 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 230 flow [2024-06-27 22:42:31,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-06-27 22:42:31,351 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-06-27 22:42:31,351 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 230 flow [2024-06-27 22:42:31,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:31,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:31,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:31,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:42:31,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:31,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1652248570, now seen corresponding path program 1 times [2024-06-27 22:42:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967082019] [2024-06-27 22:42:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:36,400 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-27 22:42:36,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:36,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967082019] [2024-06-27 22:42:36,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967082019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:36,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:36,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:42:36,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499197586] [2024-06-27 22:42:36,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:36,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:42:36,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:36,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:42:36,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:42:36,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:42:36,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 230 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:36,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:36,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:42:36,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:38,462 INFO L124 PetriNetUnfolderBase]: 5369/8315 cut-off events. [2024-06-27 22:42:38,462 INFO L125 PetriNetUnfolderBase]: For 5971/5971 co-relation queries the response was YES. [2024-06-27 22:42:38,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20802 conditions, 8315 events. 5369/8315 cut-off events. For 5971/5971 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 48998 event pairs, 2406 based on Foata normal form. 6/7797 useless extension candidates. Maximal degree in co-relation 20784. Up to 7527 conditions per place. [2024-06-27 22:42:38,494 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 103 selfloop transitions, 18 changer transitions 3/130 dead transitions. [2024-06-27 22:42:38,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 130 transitions, 672 flow [2024-06-27 22:42:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:42:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:42:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 22:42:38,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-06-27 22:42:38,496 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 230 flow. Second operand 8 states and 196 transitions. [2024-06-27 22:42:38,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 130 transitions, 672 flow [2024-06-27 22:42:38,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 130 transitions, 640 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 22:42:38,501 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 284 flow [2024-06-27 22:42:38,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=284, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-06-27 22:42:38,502 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2024-06-27 22:42:38,502 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 284 flow [2024-06-27 22:42:38,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:38,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:38,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:38,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:42:38,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:38,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1946820808, now seen corresponding path program 1 times [2024-06-27 22:42:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197036067] [2024-06-27 22:42:38,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:43,928 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-27 22:42:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:43,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197036067] [2024-06-27 22:42:43,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197036067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:43,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:43,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:42:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901326996] [2024-06-27 22:42:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:42:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:42:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:42:43,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 22:42:43,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-27 22:42:43,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:43,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 22:42:43,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:46,239 INFO L124 PetriNetUnfolderBase]: 5040/7758 cut-off events. [2024-06-27 22:42:46,240 INFO L125 PetriNetUnfolderBase]: For 9143/9143 co-relation queries the response was YES. [2024-06-27 22:42:46,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20834 conditions, 7758 events. 5040/7758 cut-off events. For 9143/9143 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 44410 event pairs, 2344 based on Foata normal form. 6/7312 useless extension candidates. Maximal degree in co-relation 20813. Up to 7234 conditions per place. [2024-06-27 22:42:46,277 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 81 selfloop transitions, 18 changer transitions 0/107 dead transitions. [2024-06-27 22:42:46,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 614 flow [2024-06-27 22:42:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:42:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:42:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-06-27 22:42:46,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5283687943262412 [2024-06-27 22:42:46,281 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 284 flow. Second operand 6 states and 149 transitions. [2024-06-27 22:42:46,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 614 flow [2024-06-27 22:42:46,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 107 transitions, 569 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:42:46,295 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 352 flow [2024-06-27 22:42:46,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-06-27 22:42:46,297 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2024-06-27 22:42:46,297 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 352 flow [2024-06-27 22:42:46,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-27 22:42:46,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:46,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:46,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:42:46,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:46,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 234620267, now seen corresponding path program 1 times [2024-06-27 22:42:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412379527] [2024-06-27 22:42:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:46,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:46,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412379527] [2024-06-27 22:42:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412379527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:46,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:46,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:42:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428398250] [2024-06-27 22:42:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:46,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:42:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:42:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:42:46,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:42:46,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:46,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:46,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:42:46,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:47,446 INFO L124 PetriNetUnfolderBase]: 2292/4088 cut-off events. [2024-06-27 22:42:47,446 INFO L125 PetriNetUnfolderBase]: For 6451/6557 co-relation queries the response was YES. [2024-06-27 22:42:47,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10939 conditions, 4088 events. 2292/4088 cut-off events. For 6451/6557 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 28630 event pairs, 1072 based on Foata normal form. 22/3777 useless extension candidates. Maximal degree in co-relation 10915. Up to 2480 conditions per place. [2024-06-27 22:42:47,467 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 58 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2024-06-27 22:42:47,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 87 transitions, 530 flow [2024-06-27 22:42:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:42:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:42:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-06-27 22:42:47,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7092198581560284 [2024-06-27 22:42:47,469 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 352 flow. Second operand 3 states and 100 transitions. [2024-06-27 22:42:47,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 87 transitions, 530 flow [2024-06-27 22:42:47,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 87 transitions, 506 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 22:42:47,474 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 312 flow [2024-06-27 22:42:47,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-06-27 22:42:47,475 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-06-27 22:42:47,475 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 312 flow [2024-06-27 22:42:47,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:47,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:47,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:47,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:42:47,476 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:47,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 234865778, now seen corresponding path program 1 times [2024-06-27 22:42:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:47,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995896655] [2024-06-27 22:42:47,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:53,002 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-27 22:42:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995896655] [2024-06-27 22:42:53,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995896655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:53,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:53,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:42:53,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506590026] [2024-06-27 22:42:53,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:53,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:42:53,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:53,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:42:53,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:42:53,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:42:53,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-27 22:42:53,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:53,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:42:53,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:55,159 INFO L124 PetriNetUnfolderBase]: 4685/7270 cut-off events. [2024-06-27 22:42:55,159 INFO L125 PetriNetUnfolderBase]: For 11842/11842 co-relation queries the response was YES. [2024-06-27 22:42:55,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20527 conditions, 7270 events. 4685/7270 cut-off events. For 11842/11842 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 41841 event pairs, 1951 based on Foata normal form. 8/7096 useless extension candidates. Maximal degree in co-relation 20502. Up to 6354 conditions per place. [2024-06-27 22:42:55,193 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 99 selfloop transitions, 19 changer transitions 4/128 dead transitions. [2024-06-27 22:42:55,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 767 flow [2024-06-27 22:42:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:42:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:42:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-06-27 22:42:55,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2024-06-27 22:42:55,195 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 312 flow. Second operand 6 states and 152 transitions. [2024-06-27 22:42:55,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 767 flow [2024-06-27 22:42:55,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:42:55,203 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 456 flow [2024-06-27 22:42:55,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=456, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2024-06-27 22:42:55,203 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2024-06-27 22:42:55,204 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 456 flow [2024-06-27 22:42:55,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-27 22:42:55,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:55,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:55,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:42:55,204 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:55,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1703422727, now seen corresponding path program 1 times [2024-06-27 22:42:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:55,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713722352] [2024-06-27 22:42:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:55,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:02,866 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-27 22:43:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713722352] [2024-06-27 22:43:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713722352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:02,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:02,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784746176] [2024-06-27 22:43:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:02,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:02,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:02,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:02,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:43:02,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 456 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:02,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:02,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:43:02,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:04,777 INFO L124 PetriNetUnfolderBase]: 4249/6671 cut-off events. [2024-06-27 22:43:04,777 INFO L125 PetriNetUnfolderBase]: For 15018/15022 co-relation queries the response was YES. [2024-06-27 22:43:04,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20917 conditions, 6671 events. 4249/6671 cut-off events. For 15018/15022 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 38541 event pairs, 1717 based on Foata normal form. 6/6491 useless extension candidates. Maximal degree in co-relation 20886. Up to 5969 conditions per place. [2024-06-27 22:43:04,811 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 110 selfloop transitions, 28 changer transitions 0/144 dead transitions. [2024-06-27 22:43:04,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 144 transitions, 986 flow [2024-06-27 22:43:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:43:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:43:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-27 22:43:04,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045592705167173 [2024-06-27 22:43:04,813 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 456 flow. Second operand 7 states and 166 transitions. [2024-06-27 22:43:04,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 144 transitions, 986 flow [2024-06-27 22:43:04,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 144 transitions, 972 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-27 22:43:04,830 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 684 flow [2024-06-27 22:43:04,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=684, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2024-06-27 22:43:04,832 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2024-06-27 22:43:04,832 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 684 flow [2024-06-27 22:43:04,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:04,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:04,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:04,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:43:04,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:04,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1504000967, now seen corresponding path program 2 times [2024-06-27 22:43:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919114545] [2024-06-27 22:43:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:04,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:09,895 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-27 22:43:09,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919114545] [2024-06-27 22:43:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919114545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:09,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441715918] [2024-06-27 22:43:09,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:09,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:09,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:09,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:09,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:09,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:43:09,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 684 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:09,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:09,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:43:09,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:11,831 INFO L124 PetriNetUnfolderBase]: 4320/6772 cut-off events. [2024-06-27 22:43:11,831 INFO L125 PetriNetUnfolderBase]: For 18503/18503 co-relation queries the response was YES. [2024-06-27 22:43:11,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22699 conditions, 6772 events. 4320/6772 cut-off events. For 18503/18503 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 38970 event pairs, 1710 based on Foata normal form. 2/6587 useless extension candidates. Maximal degree in co-relation 22661. Up to 6132 conditions per place. [2024-06-27 22:43:11,864 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 116 selfloop transitions, 25 changer transitions 0/147 dead transitions. [2024-06-27 22:43:11,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 147 transitions, 1168 flow [2024-06-27 22:43:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:43:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:43:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-06-27 22:43:11,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47416413373860183 [2024-06-27 22:43:11,866 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 684 flow. Second operand 7 states and 156 transitions. [2024-06-27 22:43:11,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 147 transitions, 1168 flow [2024-06-27 22:43:11,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 1126 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 22:43:11,884 INFO L231 Difference]: Finished difference. Result has 90 places, 110 transitions, 838 flow [2024-06-27 22:43:11,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=838, PETRI_PLACES=90, PETRI_TRANSITIONS=110} [2024-06-27 22:43:11,885 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2024-06-27 22:43:11,885 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 110 transitions, 838 flow [2024-06-27 22:43:11,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:11,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:11,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:11,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:43:11,886 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:11,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1703302571, now seen corresponding path program 1 times [2024-06-27 22:43:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436989342] [2024-06-27 22:43:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:11,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:17,690 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-27 22:43:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436989342] [2024-06-27 22:43:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436989342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:17,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:17,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972858186] [2024-06-27 22:43:17,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:17,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:17,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:43:17,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 110 transitions, 838 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:17,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:17,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:43:17,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:20,306 INFO L124 PetriNetUnfolderBase]: 4965/7717 cut-off events. [2024-06-27 22:43:20,306 INFO L125 PetriNetUnfolderBase]: For 23066/23072 co-relation queries the response was YES. [2024-06-27 22:43:20,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26254 conditions, 7717 events. 4965/7717 cut-off events. For 23066/23072 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 44839 event pairs, 1759 based on Foata normal form. 14/7522 useless extension candidates. Maximal degree in co-relation 26212. Up to 6454 conditions per place. [2024-06-27 22:43:20,341 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 153 selfloop transitions, 53 changer transitions 0/212 dead transitions. [2024-06-27 22:43:20,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 212 transitions, 1708 flow [2024-06-27 22:43:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:43:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:43:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-06-27 22:43:20,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49148936170212765 [2024-06-27 22:43:20,344 INFO L175 Difference]: Start difference. First operand has 90 places, 110 transitions, 838 flow. Second operand 10 states and 231 transitions. [2024-06-27 22:43:20,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 212 transitions, 1708 flow [2024-06-27 22:43:20,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 212 transitions, 1667 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-27 22:43:20,368 INFO L231 Difference]: Finished difference. Result has 102 places, 136 transitions, 1191 flow [2024-06-27 22:43:20,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1191, PETRI_PLACES=102, PETRI_TRANSITIONS=136} [2024-06-27 22:43:20,369 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-06-27 22:43:20,369 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 136 transitions, 1191 flow [2024-06-27 22:43:20,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:20,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:20,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:20,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:43:20,370 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:20,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1941456239, now seen corresponding path program 2 times [2024-06-27 22:43:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329791732] [2024-06-27 22:43:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:27,146 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-27 22:43:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:27,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329791732] [2024-06-27 22:43:27,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329791732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:27,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:27,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935053694] [2024-06-27 22:43:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:27,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:27,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:27,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:27,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:27,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:43:27,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 136 transitions, 1191 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:27,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:27,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:43:27,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:31,152 INFO L124 PetriNetUnfolderBase]: 5471/8427 cut-off events. [2024-06-27 22:43:31,152 INFO L125 PetriNetUnfolderBase]: For 34670/34693 co-relation queries the response was YES. [2024-06-27 22:43:31,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31973 conditions, 8427 events. 5471/8427 cut-off events. For 34670/34693 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 48950 event pairs, 1524 based on Foata normal form. 26/8239 useless extension candidates. Maximal degree in co-relation 31925. Up to 6219 conditions per place. [2024-06-27 22:43:31,197 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 176 selfloop transitions, 148 changer transitions 0/330 dead transitions. [2024-06-27 22:43:31,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 330 transitions, 3030 flow [2024-06-27 22:43:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:43:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:43:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 316 transitions. [2024-06-27 22:43:31,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48024316109422494 [2024-06-27 22:43:31,199 INFO L175 Difference]: Start difference. First operand has 102 places, 136 transitions, 1191 flow. Second operand 14 states and 316 transitions. [2024-06-27 22:43:31,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 330 transitions, 3030 flow [2024-06-27 22:43:31,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 330 transitions, 2910 flow, removed 57 selfloop flow, removed 2 redundant places. [2024-06-27 22:43:31,248 INFO L231 Difference]: Finished difference. Result has 118 places, 253 transitions, 2454 flow [2024-06-27 22:43:31,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2454, PETRI_PLACES=118, PETRI_TRANSITIONS=253} [2024-06-27 22:43:31,249 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 65 predicate places. [2024-06-27 22:43:31,249 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 253 transitions, 2454 flow [2024-06-27 22:43:31,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:31,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:31,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:31,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:43:31,250 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:31,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1496649131, now seen corresponding path program 3 times [2024-06-27 22:43:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382983665] [2024-06-27 22:43:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:39,007 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-27 22:43:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382983665] [2024-06-27 22:43:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382983665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:39,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711524171] [2024-06-27 22:43:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:39,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:39,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:39,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:43:39,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 253 transitions, 2454 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:39,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:39,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:43:39,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:42,043 INFO L124 PetriNetUnfolderBase]: 5452/8449 cut-off events. [2024-06-27 22:43:42,043 INFO L125 PetriNetUnfolderBase]: For 47335/47355 co-relation queries the response was YES. [2024-06-27 22:43:42,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36714 conditions, 8449 events. 5452/8449 cut-off events. For 47335/47355 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 49299 event pairs, 1572 based on Foata normal form. 24/8243 useless extension candidates. Maximal degree in co-relation 36660. Up to 7362 conditions per place. [2024-06-27 22:43:42,108 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 258 selfloop transitions, 62 changer transitions 0/326 dead transitions. [2024-06-27 22:43:42,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 326 transitions, 3435 flow [2024-06-27 22:43:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:43:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:43:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-27 22:43:42,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-06-27 22:43:42,111 INFO L175 Difference]: Start difference. First operand has 118 places, 253 transitions, 2454 flow. Second operand 9 states and 198 transitions. [2024-06-27 22:43:42,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 326 transitions, 3435 flow [2024-06-27 22:43:42,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 326 transitions, 3133 flow, removed 138 selfloop flow, removed 2 redundant places. [2024-06-27 22:43:42,289 INFO L231 Difference]: Finished difference. Result has 126 places, 258 transitions, 2431 flow [2024-06-27 22:43:42,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2431, PETRI_PLACES=126, PETRI_TRANSITIONS=258} [2024-06-27 22:43:42,290 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 73 predicate places. [2024-06-27 22:43:42,290 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 258 transitions, 2431 flow [2024-06-27 22:43:42,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:42,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:42,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:42,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:43:42,292 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:42,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1496649317, now seen corresponding path program 3 times [2024-06-27 22:43:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:42,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528375620] [2024-06-27 22:43:42,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:42,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:47,451 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-27 22:43:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528375620] [2024-06-27 22:43:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528375620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349367911] [2024-06-27 22:43:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:47,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:47,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:47,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:47,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:43:47,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 258 transitions, 2431 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:47,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:47,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:43:47,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:49,672 INFO L124 PetriNetUnfolderBase]: 5475/8481 cut-off events. [2024-06-27 22:43:49,672 INFO L125 PetriNetUnfolderBase]: For 46629/46649 co-relation queries the response was YES. [2024-06-27 22:43:49,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36285 conditions, 8481 events. 5475/8481 cut-off events. For 46629/46649 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 49546 event pairs, 1584 based on Foata normal form. 18/8269 useless extension candidates. Maximal degree in co-relation 36228. Up to 7662 conditions per place. [2024-06-27 22:43:49,731 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 256 selfloop transitions, 36 changer transitions 0/298 dead transitions. [2024-06-27 22:43:49,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 298 transitions, 3144 flow [2024-06-27 22:43:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:43:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:43:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-27 22:43:49,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43617021276595747 [2024-06-27 22:43:49,733 INFO L175 Difference]: Start difference. First operand has 126 places, 258 transitions, 2431 flow. Second operand 8 states and 164 transitions. [2024-06-27 22:43:49,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 298 transitions, 3144 flow [2024-06-27 22:43:49,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 298 transitions, 2996 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-27 22:43:49,863 INFO L231 Difference]: Finished difference. Result has 129 places, 263 transitions, 2421 flow [2024-06-27 22:43:49,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2283, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2421, PETRI_PLACES=129, PETRI_TRANSITIONS=263} [2024-06-27 22:43:49,863 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 76 predicate places. [2024-06-27 22:43:49,863 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 263 transitions, 2421 flow [2024-06-27 22:43:49,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:49,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:49,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:49,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:43:49,864 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:49,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1792761229, now seen corresponding path program 4 times [2024-06-27 22:43:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85284667] [2024-06-27 22:43:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:55,218 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-27 22:43:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85284667] [2024-06-27 22:43:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85284667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:55,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:43:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257269257] [2024-06-27 22:43:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:55,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:43:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:43:55,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:43:55,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:43:55,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 263 transitions, 2421 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:55,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:55,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:43:55,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:58,597 INFO L124 PetriNetUnfolderBase]: 5978/9186 cut-off events. [2024-06-27 22:43:58,597 INFO L125 PetriNetUnfolderBase]: For 51291/51311 co-relation queries the response was YES. [2024-06-27 22:43:58,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39397 conditions, 9186 events. 5978/9186 cut-off events. For 51291/51311 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 53831 event pairs, 1516 based on Foata normal form. 24/8974 useless extension candidates. Maximal degree in co-relation 39340. Up to 7399 conditions per place. [2024-06-27 22:43:58,647 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 241 selfloop transitions, 158 changer transitions 0/405 dead transitions. [2024-06-27 22:43:58,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 405 transitions, 4232 flow [2024-06-27 22:43:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:43:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:43:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2024-06-27 22:43:58,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410058027079304 [2024-06-27 22:43:58,649 INFO L175 Difference]: Start difference. First operand has 129 places, 263 transitions, 2421 flow. Second operand 11 states and 228 transitions. [2024-06-27 22:43:58,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 405 transitions, 4232 flow [2024-06-27 22:43:58,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 405 transitions, 4158 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 22:43:58,760 INFO L231 Difference]: Finished difference. Result has 142 places, 345 transitions, 3756 flow [2024-06-27 22:43:58,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3756, PETRI_PLACES=142, PETRI_TRANSITIONS=345} [2024-06-27 22:43:58,760 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 89 predicate places. [2024-06-27 22:43:58,760 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 345 transitions, 3756 flow [2024-06-27 22:43:58,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:58,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:58,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:58,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:43:58,761 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:58,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1792761415, now seen corresponding path program 4 times [2024-06-27 22:43:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:58,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939494366] [2024-06-27 22:43:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:58,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:03,825 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-27 22:44:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939494366] [2024-06-27 22:44:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939494366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:03,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:44:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987343434] [2024-06-27 22:44:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:03,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:44:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:44:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:44:03,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:44:03,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 345 transitions, 3756 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:03,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:03,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:44:03,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:06,641 INFO L124 PetriNetUnfolderBase]: 6043/9302 cut-off events. [2024-06-27 22:44:06,641 INFO L125 PetriNetUnfolderBase]: For 66805/66825 co-relation queries the response was YES. [2024-06-27 22:44:06,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44004 conditions, 9302 events. 6043/9302 cut-off events. For 66805/66825 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 54715 event pairs, 1575 based on Foata normal form. 18/9075 useless extension candidates. Maximal degree in co-relation 43941. Up to 8280 conditions per place. [2024-06-27 22:44:06,706 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 328 selfloop transitions, 66 changer transitions 0/400 dead transitions. [2024-06-27 22:44:06,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 400 transitions, 4803 flow [2024-06-27 22:44:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:44:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:44:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 22:44:06,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075987841945289 [2024-06-27 22:44:06,707 INFO L175 Difference]: Start difference. First operand has 142 places, 345 transitions, 3756 flow. Second operand 7 states and 167 transitions. [2024-06-27 22:44:06,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 400 transitions, 4803 flow [2024-06-27 22:44:06,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 400 transitions, 4670 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-06-27 22:44:06,906 INFO L231 Difference]: Finished difference. Result has 146 places, 355 transitions, 3904 flow [2024-06-27 22:44:06,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3623, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3904, PETRI_PLACES=146, PETRI_TRANSITIONS=355} [2024-06-27 22:44:06,906 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 93 predicate places. [2024-06-27 22:44:06,907 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 355 transitions, 3904 flow [2024-06-27 22:44:06,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:06,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:06,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:06,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:44:06,907 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:06,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1496372301, now seen corresponding path program 1 times [2024-06-27 22:44:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132734242] [2024-06-27 22:44:06,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:06,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:14,388 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-27 22:44:14,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:14,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132734242] [2024-06-27 22:44:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132734242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:14,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:14,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:44:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412517182] [2024-06-27 22:44:14,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:14,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:44:14,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:14,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:44:14,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:44:14,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:44:14,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 355 transitions, 3904 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:14,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:14,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:44:14,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:17,334 INFO L124 PetriNetUnfolderBase]: 6263/9615 cut-off events. [2024-06-27 22:44:17,334 INFO L125 PetriNetUnfolderBase]: For 74402/74402 co-relation queries the response was YES. [2024-06-27 22:44:17,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46462 conditions, 9615 events. 6263/9615 cut-off events. For 74402/74402 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 56743 event pairs, 1597 based on Foata normal form. 16/9392 useless extension candidates. Maximal degree in co-relation 46397. Up to 8215 conditions per place. [2024-06-27 22:44:17,409 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 381 selfloop transitions, 49 changer transitions 0/436 dead transitions. [2024-06-27 22:44:17,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 436 transitions, 5171 flow [2024-06-27 22:44:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:44:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:44:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-06-27 22:44:17,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920212765957447 [2024-06-27 22:44:17,410 INFO L175 Difference]: Start difference. First operand has 146 places, 355 transitions, 3904 flow. Second operand 8 states and 185 transitions. [2024-06-27 22:44:17,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 436 transitions, 5171 flow [2024-06-27 22:44:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 436 transitions, 5044 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-27 22:44:17,565 INFO L231 Difference]: Finished difference. Result has 151 places, 357 transitions, 3922 flow [2024-06-27 22:44:17,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3783, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3922, PETRI_PLACES=151, PETRI_TRANSITIONS=357} [2024-06-27 22:44:17,566 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 98 predicate places. [2024-06-27 22:44:17,566 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 357 transitions, 3922 flow [2024-06-27 22:44:17,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:17,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:17,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:17,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:44:17,567 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:17,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1266584026, now seen corresponding path program 1 times [2024-06-27 22:44:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101662848] [2024-06-27 22:44:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:23,390 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-27 22:44:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:23,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101662848] [2024-06-27 22:44:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101662848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:23,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:44:23,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218791947] [2024-06-27 22:44:23,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:23,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:44:23,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:23,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:44:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:44:23,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:44:23,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 357 transitions, 3922 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:23,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:23,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:44:23,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:26,162 INFO L124 PetriNetUnfolderBase]: 6338/9757 cut-off events. [2024-06-27 22:44:26,162 INFO L125 PetriNetUnfolderBase]: For 71856/71881 co-relation queries the response was YES. [2024-06-27 22:44:26,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47735 conditions, 9757 events. 6338/9757 cut-off events. For 71856/71881 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 58133 event pairs, 1528 based on Foata normal form. 23/9528 useless extension candidates. Maximal degree in co-relation 47668. Up to 8705 conditions per place. [2024-06-27 22:44:26,238 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 368 selfloop transitions, 54 changer transitions 0/428 dead transitions. [2024-06-27 22:44:26,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 428 transitions, 5082 flow [2024-06-27 22:44:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:44:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:44:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-06-27 22:44:26,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5623100303951368 [2024-06-27 22:44:26,240 INFO L175 Difference]: Start difference. First operand has 151 places, 357 transitions, 3922 flow. Second operand 7 states and 185 transitions. [2024-06-27 22:44:26,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 428 transitions, 5082 flow [2024-06-27 22:44:26,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 428 transitions, 4977 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:26,432 INFO L231 Difference]: Finished difference. Result has 153 places, 366 transitions, 4049 flow [2024-06-27 22:44:26,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3817, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4049, PETRI_PLACES=153, PETRI_TRANSITIONS=366} [2024-06-27 22:44:26,433 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 100 predicate places. [2024-06-27 22:44:26,433 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 366 transitions, 4049 flow [2024-06-27 22:44:26,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:26,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:26,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:26,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:44:26,433 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:26,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1916082409, now seen corresponding path program 1 times [2024-06-27 22:44:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327136676] [2024-06-27 22:44:26,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:34,919 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-27 22:44:34,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:34,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327136676] [2024-06-27 22:44:34,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327136676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:34,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:34,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:44:34,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023897277] [2024-06-27 22:44:34,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:34,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:44:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:44:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:44:34,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:44:34,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 366 transitions, 4049 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:34,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:34,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:44:34,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:37,998 INFO L124 PetriNetUnfolderBase]: 6642/10177 cut-off events. [2024-06-27 22:44:37,999 INFO L125 PetriNetUnfolderBase]: For 82118/82143 co-relation queries the response was YES. [2024-06-27 22:44:38,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50736 conditions, 10177 events. 6642/10177 cut-off events. For 82118/82143 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 60330 event pairs, 1535 based on Foata normal form. 29/9951 useless extension candidates. Maximal degree in co-relation 50668. Up to 8640 conditions per place. [2024-06-27 22:44:38,083 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 388 selfloop transitions, 90 changer transitions 0/484 dead transitions. [2024-06-27 22:44:38,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 484 transitions, 5815 flow [2024-06-27 22:44:38,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:44:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:44:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-06-27 22:44:38,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200945626477541 [2024-06-27 22:44:38,085 INFO L175 Difference]: Start difference. First operand has 153 places, 366 transitions, 4049 flow. Second operand 9 states and 220 transitions. [2024-06-27 22:44:38,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 484 transitions, 5815 flow [2024-06-27 22:44:38,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 484 transitions, 5726 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 22:44:38,290 INFO L231 Difference]: Finished difference. Result has 162 places, 408 transitions, 4677 flow [2024-06-27 22:44:38,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3960, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4677, PETRI_PLACES=162, PETRI_TRANSITIONS=408} [2024-06-27 22:44:38,291 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 109 predicate places. [2024-06-27 22:44:38,291 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 408 transitions, 4677 flow [2024-06-27 22:44:38,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:38,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:38,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:38,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:44:38,292 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:38,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1266493816, now seen corresponding path program 2 times [2024-06-27 22:44:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:38,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894520787] [2024-06-27 22:44:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:48,060 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-27 22:44:48,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894520787] [2024-06-27 22:44:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894520787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:48,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:48,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:44:48,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411731847] [2024-06-27 22:44:48,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:48,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:44:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:48,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:44:48,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:44:48,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:44:48,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 408 transitions, 4677 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:48,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:48,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:44:48,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:51,128 INFO L124 PetriNetUnfolderBase]: 6661/10209 cut-off events. [2024-06-27 22:44:51,128 INFO L125 PetriNetUnfolderBase]: For 95212/95237 co-relation queries the response was YES. [2024-06-27 22:44:51,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54623 conditions, 10209 events. 6661/10209 cut-off events. For 95212/95237 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 60671 event pairs, 1588 based on Foata normal form. 23/9975 useless extension candidates. Maximal degree in co-relation 54550. Up to 9175 conditions per place. [2024-06-27 22:44:51,213 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 409 selfloop transitions, 59 changer transitions 0/474 dead transitions. [2024-06-27 22:44:51,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 474 transitions, 5911 flow [2024-06-27 22:44:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:44:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:44:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 22:44:51,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026595744680851 [2024-06-27 22:44:51,215 INFO L175 Difference]: Start difference. First operand has 162 places, 408 transitions, 4677 flow. Second operand 8 states and 189 transitions. [2024-06-27 22:44:51,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 474 transitions, 5911 flow [2024-06-27 22:44:51,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 474 transitions, 5812 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-27 22:44:51,471 INFO L231 Difference]: Finished difference. Result has 167 places, 418 transitions, 4885 flow [2024-06-27 22:44:51,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4578, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4885, PETRI_PLACES=167, PETRI_TRANSITIONS=418} [2024-06-27 22:44:51,471 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 114 predicate places. [2024-06-27 22:44:51,472 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 418 transitions, 4885 flow [2024-06-27 22:44:51,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:51,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:51,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:51,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:44:51,472 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:51,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1973147038, now seen corresponding path program 3 times [2024-06-27 22:44:51,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:51,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095748824] [2024-06-27 22:44:51,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:51,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:57,595 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-27 22:44:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095748824] [2024-06-27 22:44:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095748824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:57,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:44:57,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766819814] [2024-06-27 22:44:57,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:57,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:44:57,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:44:57,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:44:57,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:44:57,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 418 transitions, 4885 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:57,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:57,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:44:57,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:00,464 INFO L124 PetriNetUnfolderBase]: 6684/10236 cut-off events. [2024-06-27 22:45:00,464 INFO L125 PetriNetUnfolderBase]: For 102546/102546 co-relation queries the response was YES. [2024-06-27 22:45:00,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56010 conditions, 10236 events. 6684/10236 cut-off events. For 102546/102546 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 60715 event pairs, 1580 based on Foata normal form. 2/9982 useless extension candidates. Maximal degree in co-relation 55935. Up to 9326 conditions per place. [2024-06-27 22:45:00,536 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 426 selfloop transitions, 36 changer transitions 0/468 dead transitions. [2024-06-27 22:45:00,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 468 transitions, 5968 flow [2024-06-27 22:45:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:45:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:45:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 22:45:00,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075987841945289 [2024-06-27 22:45:00,539 INFO L175 Difference]: Start difference. First operand has 167 places, 418 transitions, 4885 flow. Second operand 7 states and 167 transitions. [2024-06-27 22:45:00,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 468 transitions, 5968 flow [2024-06-27 22:45:00,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 468 transitions, 5819 flow, removed 58 selfloop flow, removed 3 redundant places. [2024-06-27 22:45:00,780 INFO L231 Difference]: Finished difference. Result has 171 places, 422 transitions, 4879 flow [2024-06-27 22:45:00,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4736, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4879, PETRI_PLACES=171, PETRI_TRANSITIONS=422} [2024-06-27 22:45:00,781 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 118 predicate places. [2024-06-27 22:45:00,781 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 422 transitions, 4879 flow [2024-06-27 22:45:00,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:00,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:00,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:00,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:45:00,782 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:00,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash 620613603, now seen corresponding path program 2 times [2024-06-27 22:45:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604277837] [2024-06-27 22:45:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:06,253 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-27 22:45:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604277837] [2024-06-27 22:45:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604277837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316481253] [2024-06-27 22:45:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:06,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:06,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:45:06,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 422 transitions, 4879 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:06,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:06,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:45:06,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:09,610 INFO L124 PetriNetUnfolderBase]: 6892/10520 cut-off events. [2024-06-27 22:45:09,610 INFO L125 PetriNetUnfolderBase]: For 110273/110273 co-relation queries the response was YES. [2024-06-27 22:45:09,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58232 conditions, 10520 events. 6892/10520 cut-off events. For 110273/110273 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 62271 event pairs, 1588 based on Foata normal form. 6/10269 useless extension candidates. Maximal degree in co-relation 58155. Up to 9433 conditions per place. [2024-06-27 22:45:09,690 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 446 selfloop transitions, 63 changer transitions 0/515 dead transitions. [2024-06-27 22:45:09,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 515 transitions, 6610 flow [2024-06-27 22:45:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:45:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:45:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-06-27 22:45:09,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4553191489361702 [2024-06-27 22:45:09,692 INFO L175 Difference]: Start difference. First operand has 171 places, 422 transitions, 4879 flow. Second operand 10 states and 214 transitions. [2024-06-27 22:45:09,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 515 transitions, 6610 flow [2024-06-27 22:45:09,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 515 transitions, 6493 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-27 22:45:09,949 INFO L231 Difference]: Finished difference. Result has 179 places, 457 transitions, 5395 flow [2024-06-27 22:45:09,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4762, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5395, PETRI_PLACES=179, PETRI_TRANSITIONS=457} [2024-06-27 22:45:09,950 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 126 predicate places. [2024-06-27 22:45:09,950 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 457 transitions, 5395 flow [2024-06-27 22:45:09,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:09,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:09,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:09,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:45:09,950 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:09,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1262769011, now seen corresponding path program 3 times [2024-06-27 22:45:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191953412] [2024-06-27 22:45:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:15,161 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-27 22:45:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191953412] [2024-06-27 22:45:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191953412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636109702] [2024-06-27 22:45:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:15,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:15,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:45:15,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 457 transitions, 5395 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:15,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:15,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:45:15,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:18,347 INFO L124 PetriNetUnfolderBase]: 6916/10552 cut-off events. [2024-06-27 22:45:18,347 INFO L125 PetriNetUnfolderBase]: For 122591/122591 co-relation queries the response was YES. [2024-06-27 22:45:18,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60581 conditions, 10552 events. 6916/10552 cut-off events. For 122591/122591 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 62421 event pairs, 1580 based on Foata normal form. 6/10301 useless extension candidates. Maximal degree in co-relation 60501. Up to 9600 conditions per place. [2024-06-27 22:45:18,441 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 463 selfloop transitions, 49 changer transitions 0/518 dead transitions. [2024-06-27 22:45:18,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 518 transitions, 6741 flow [2024-06-27 22:45:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:45:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:45:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-06-27 22:45:18,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475177304964539 [2024-06-27 22:45:18,442 INFO L175 Difference]: Start difference. First operand has 179 places, 457 transitions, 5395 flow. Second operand 9 states and 201 transitions. [2024-06-27 22:45:18,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 518 transitions, 6741 flow [2024-06-27 22:45:18,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 518 transitions, 6631 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-06-27 22:45:18,748 INFO L231 Difference]: Finished difference. Result has 184 places, 466 transitions, 5574 flow [2024-06-27 22:45:18,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5289, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5574, PETRI_PLACES=184, PETRI_TRANSITIONS=466} [2024-06-27 22:45:18,749 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 131 predicate places. [2024-06-27 22:45:18,749 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 466 transitions, 5574 flow [2024-06-27 22:45:18,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:18,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:18,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:18,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:45:18,749 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:18,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 856794543, now seen corresponding path program 4 times [2024-06-27 22:45:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371093070] [2024-06-27 22:45:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:25,576 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-27 22:45:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:25,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371093070] [2024-06-27 22:45:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371093070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:25,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:25,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:25,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438098817] [2024-06-27 22:45:25,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:25,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:25,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:25,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:25,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:45:25,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 466 transitions, 5574 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:25,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:25,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:45:25,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:29,222 INFO L124 PetriNetUnfolderBase]: 6968/10625 cut-off events. [2024-06-27 22:45:29,222 INFO L125 PetriNetUnfolderBase]: For 130998/131019 co-relation queries the response was YES. [2024-06-27 22:45:29,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61618 conditions, 10625 events. 6968/10625 cut-off events. For 130998/131019 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 62873 event pairs, 1601 based on Foata normal form. 22/10389 useless extension candidates. Maximal degree in co-relation 61536. Up to 9360 conditions per place. [2024-06-27 22:45:29,310 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 401 selfloop transitions, 125 changer transitions 0/532 dead transitions. [2024-06-27 22:45:29,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 532 transitions, 7027 flow [2024-06-27 22:45:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:45:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:45:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2024-06-27 22:45:29,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-27 22:45:29,312 INFO L175 Difference]: Start difference. First operand has 184 places, 466 transitions, 5574 flow. Second operand 12 states and 235 transitions. [2024-06-27 22:45:29,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 532 transitions, 7027 flow [2024-06-27 22:45:29,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 532 transitions, 6897 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 22:45:29,641 INFO L231 Difference]: Finished difference. Result has 193 places, 485 transitions, 6047 flow [2024-06-27 22:45:29,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5444, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6047, PETRI_PLACES=193, PETRI_TRANSITIONS=485} [2024-06-27 22:45:29,642 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 140 predicate places. [2024-06-27 22:45:29,642 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 485 transitions, 6047 flow [2024-06-27 22:45:29,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:29,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:29,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:29,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:45:29,643 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:29,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash 848520333, now seen corresponding path program 5 times [2024-06-27 22:45:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861528942] [2024-06-27 22:45:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:35,389 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-27 22:45:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:35,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861528942] [2024-06-27 22:45:35,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861528942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:35,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:35,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:35,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199513839] [2024-06-27 22:45:35,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:35,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:35,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:35,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:35,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:35,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:45:35,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 485 transitions, 6047 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:35,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:35,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:45:35,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:39,194 INFO L124 PetriNetUnfolderBase]: 7048/10735 cut-off events. [2024-06-27 22:45:39,194 INFO L125 PetriNetUnfolderBase]: For 142301/142322 co-relation queries the response was YES. [2024-06-27 22:45:39,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64637 conditions, 10735 events. 7048/10735 cut-off events. For 142301/142322 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 63437 event pairs, 1597 based on Foata normal form. 22/10499 useless extension candidates. Maximal degree in co-relation 64551. Up to 9748 conditions per place. [2024-06-27 22:45:39,296 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 485 selfloop transitions, 57 changer transitions 0/548 dead transitions. [2024-06-27 22:45:39,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 548 transitions, 7471 flow [2024-06-27 22:45:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:45:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:45:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-27 22:45:39,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-06-27 22:45:39,297 INFO L175 Difference]: Start difference. First operand has 193 places, 485 transitions, 6047 flow. Second operand 9 states and 198 transitions. [2024-06-27 22:45:39,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 548 transitions, 7471 flow [2024-06-27 22:45:39,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 548 transitions, 7234 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-27 22:45:39,674 INFO L231 Difference]: Finished difference. Result has 197 places, 499 transitions, 6202 flow [2024-06-27 22:45:39,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5817, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6202, PETRI_PLACES=197, PETRI_TRANSITIONS=499} [2024-06-27 22:45:39,675 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 144 predicate places. [2024-06-27 22:45:39,675 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 499 transitions, 6202 flow [2024-06-27 22:45:39,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:39,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:39,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:39,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:45:39,676 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:39,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash 848514598, now seen corresponding path program 4 times [2024-06-27 22:45:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:39,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029368325] [2024-06-27 22:45:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:46,413 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-27 22:45:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029368325] [2024-06-27 22:45:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029368325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563002900] [2024-06-27 22:45:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:46,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:46,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:45:46,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 499 transitions, 6202 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:46,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:46,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:45:46,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:49,468 INFO L124 PetriNetUnfolderBase]: 7051/10742 cut-off events. [2024-06-27 22:45:49,468 INFO L125 PetriNetUnfolderBase]: For 149914/149935 co-relation queries the response was YES. [2024-06-27 22:45:49,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65624 conditions, 10742 events. 7051/10742 cut-off events. For 149914/149935 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 63500 event pairs, 1608 based on Foata normal form. 18/10501 useless extension candidates. Maximal degree in co-relation 65536. Up to 9816 conditions per place. [2024-06-27 22:45:49,566 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 506 selfloop transitions, 36 changer transitions 0/548 dead transitions. [2024-06-27 22:45:49,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 548 transitions, 7455 flow [2024-06-27 22:45:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:45:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:45:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 22:45:49,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075987841945289 [2024-06-27 22:45:49,567 INFO L175 Difference]: Start difference. First operand has 197 places, 499 transitions, 6202 flow. Second operand 7 states and 167 transitions. [2024-06-27 22:45:49,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 548 transitions, 7455 flow [2024-06-27 22:45:49,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 548 transitions, 7241 flow, removed 66 selfloop flow, removed 5 redundant places. [2024-06-27 22:45:49,948 INFO L231 Difference]: Finished difference. Result has 199 places, 502 transitions, 6121 flow [2024-06-27 22:45:49,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6002, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6121, PETRI_PLACES=199, PETRI_TRANSITIONS=502} [2024-06-27 22:45:49,949 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 146 predicate places. [2024-06-27 22:45:49,949 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 502 transitions, 6121 flow [2024-06-27 22:45:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:49,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:49,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:49,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:45:49,949 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:49,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash 848514753, now seen corresponding path program 6 times [2024-06-27 22:45:49,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:49,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544223355] [2024-06-27 22:45:49,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:55,784 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-27 22:45:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544223355] [2024-06-27 22:45:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544223355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:55,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:45:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633850195] [2024-06-27 22:45:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:55,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:45:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:55,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:45:55,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:45:55,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:45:55,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 502 transitions, 6121 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:55,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:55,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:45:55,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:59,502 INFO L124 PetriNetUnfolderBase]: 7379/11194 cut-off events. [2024-06-27 22:45:59,502 INFO L125 PetriNetUnfolderBase]: For 163360/163381 co-relation queries the response was YES. [2024-06-27 22:45:59,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68912 conditions, 11194 events. 7379/11194 cut-off events. For 163360/163381 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 66098 event pairs, 1612 based on Foata normal form. 22/10957 useless extension candidates. Maximal degree in co-relation 68824. Up to 9780 conditions per place. [2024-06-27 22:45:59,611 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 487 selfloop transitions, 118 changer transitions 0/611 dead transitions. [2024-06-27 22:45:59,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 611 transitions, 8444 flow [2024-06-27 22:45:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:45:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:45:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions. [2024-06-27 22:45:59,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48723404255319147 [2024-06-27 22:45:59,613 INFO L175 Difference]: Start difference. First operand has 199 places, 502 transitions, 6121 flow. Second operand 10 states and 229 transitions. [2024-06-27 22:45:59,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 611 transitions, 8444 flow [2024-06-27 22:46:00,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 611 transitions, 8372 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:00,025 INFO L231 Difference]: Finished difference. Result has 206 places, 544 transitions, 7079 flow [2024-06-27 22:46:00,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6049, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7079, PETRI_PLACES=206, PETRI_TRANSITIONS=544} [2024-06-27 22:46:00,026 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 153 predicate places. [2024-06-27 22:46:00,026 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 544 transitions, 7079 flow [2024-06-27 22:46:00,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:00,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:00,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:00,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:46:00,027 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:00,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:00,027 INFO L85 PathProgramCache]: Analyzing trace with hash 258979887, now seen corresponding path program 7 times [2024-06-27 22:46:00,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:00,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680608681] [2024-06-27 22:46:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:00,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:05,584 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-27 22:46:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:05,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680608681] [2024-06-27 22:46:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680608681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77465173] [2024-06-27 22:46:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:05,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:05,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:05,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:46:05,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 544 transitions, 7079 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:05,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:05,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:46:05,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:09,266 INFO L124 PetriNetUnfolderBase]: 7391/11210 cut-off events. [2024-06-27 22:46:09,266 INFO L125 PetriNetUnfolderBase]: For 179916/179937 co-relation queries the response was YES. [2024-06-27 22:46:09,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71798 conditions, 11210 events. 7391/11210 cut-off events. For 179916/179937 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 66191 event pairs, 1607 based on Foata normal form. 19/10970 useless extension candidates. Maximal degree in co-relation 71706. Up to 10090 conditions per place. [2024-06-27 22:46:09,387 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 495 selfloop transitions, 97 changer transitions 0/598 dead transitions. [2024-06-27 22:46:09,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 598 transitions, 8587 flow [2024-06-27 22:46:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-06-27 22:46:09,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2024-06-27 22:46:09,389 INFO L175 Difference]: Start difference. First operand has 206 places, 544 transitions, 7079 flow. Second operand 9 states and 189 transitions. [2024-06-27 22:46:09,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 598 transitions, 8587 flow [2024-06-27 22:46:09,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 598 transitions, 8391 flow, removed 81 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:09,880 INFO L231 Difference]: Finished difference. Result has 213 places, 558 transitions, 7380 flow [2024-06-27 22:46:09,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6883, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7380, PETRI_PLACES=213, PETRI_TRANSITIONS=558} [2024-06-27 22:46:09,881 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 160 predicate places. [2024-06-27 22:46:09,881 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 558 transitions, 7380 flow [2024-06-27 22:46:09,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:09,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:09,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:09,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:46:09,881 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:09,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash 258974307, now seen corresponding path program 8 times [2024-06-27 22:46:09,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:09,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798851678] [2024-06-27 22:46:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:09,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:15,416 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-27 22:46:15,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:15,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798851678] [2024-06-27 22:46:15,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798851678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:15,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:15,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:15,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251923639] [2024-06-27 22:46:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:15,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:15,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:15,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:15,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:46:15,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 558 transitions, 7380 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:15,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:15,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:46:15,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:19,234 INFO L124 PetriNetUnfolderBase]: 7506/11367 cut-off events. [2024-06-27 22:46:19,234 INFO L125 PetriNetUnfolderBase]: For 192569/192590 co-relation queries the response was YES. [2024-06-27 22:46:19,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74250 conditions, 11367 events. 7506/11367 cut-off events. For 192569/192590 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 67103 event pairs, 1602 based on Foata normal form. 23/11131 useless extension candidates. Maximal degree in co-relation 74154. Up to 9870 conditions per place. [2024-06-27 22:46:19,360 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 473 selfloop transitions, 151 changer transitions 0/630 dead transitions. [2024-06-27 22:46:19,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 630 transitions, 9450 flow [2024-06-27 22:46:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:46:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:46:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2024-06-27 22:46:19,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44042553191489364 [2024-06-27 22:46:19,361 INFO L175 Difference]: Start difference. First operand has 213 places, 558 transitions, 7380 flow. Second operand 10 states and 207 transitions. [2024-06-27 22:46:19,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 630 transitions, 9450 flow [2024-06-27 22:46:20,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 630 transitions, 9235 flow, removed 45 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:20,070 INFO L231 Difference]: Finished difference. Result has 217 places, 584 transitions, 8079 flow [2024-06-27 22:46:20,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7165, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8079, PETRI_PLACES=217, PETRI_TRANSITIONS=584} [2024-06-27 22:46:20,071 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 164 predicate places. [2024-06-27 22:46:20,071 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 584 transitions, 8079 flow [2024-06-27 22:46:20,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:20,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:20,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:20,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:46:20,072 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:20,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash 102442586, now seen corresponding path program 1 times [2024-06-27 22:46:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28212929] [2024-06-27 22:46:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:24,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:24,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28212929] [2024-06-27 22:46:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28212929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:46:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053410227] [2024-06-27 22:46:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:24,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:46:24,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:46:24,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:46:24,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:46:24,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 584 transitions, 8079 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-27 22:46:24,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:24,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:46:24,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:27,786 INFO L124 PetriNetUnfolderBase]: 7420/11187 cut-off events. [2024-06-27 22:46:27,786 INFO L125 PetriNetUnfolderBase]: For 215201/215203 co-relation queries the response was YES. [2024-06-27 22:46:27,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75514 conditions, 11187 events. 7420/11187 cut-off events. For 215201/215203 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 65369 event pairs, 1685 based on Foata normal form. 8/10956 useless extension candidates. Maximal degree in co-relation 75418. Up to 10140 conditions per place. [2024-06-27 22:46:27,900 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 548 selfloop transitions, 33 changer transitions 0/587 dead transitions. [2024-06-27 22:46:27,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 587 transitions, 9061 flow [2024-06-27 22:46:27,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:46:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:46:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-06-27 22:46:27,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2024-06-27 22:46:27,901 INFO L175 Difference]: Start difference. First operand has 217 places, 584 transitions, 8079 flow. Second operand 5 states and 118 transitions. [2024-06-27 22:46:27,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 587 transitions, 9061 flow [2024-06-27 22:46:28,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 587 transitions, 8857 flow, removed 79 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:28,423 INFO L231 Difference]: Finished difference. Result has 216 places, 559 transitions, 7718 flow [2024-06-27 22:46:28,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7579, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7718, PETRI_PLACES=216, PETRI_TRANSITIONS=559} [2024-06-27 22:46:28,424 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 163 predicate places. [2024-06-27 22:46:28,424 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 559 transitions, 7718 flow [2024-06-27 22:46:28,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-27 22:46:28,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:28,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:28,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:46:28,424 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:28,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash -609456392, now seen corresponding path program 1 times [2024-06-27 22:46:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474737556] [2024-06-27 22:46:28,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:35,130 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-27 22:46:35,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:35,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474737556] [2024-06-27 22:46:35,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474737556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:35,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:35,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397482963] [2024-06-27 22:46:35,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:35,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:35,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:35,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:35,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:35,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:46:35,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 559 transitions, 7718 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:35,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:35,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:46:35,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:39,542 INFO L124 PetriNetUnfolderBase]: 7541/11237 cut-off events. [2024-06-27 22:46:39,542 INFO L125 PetriNetUnfolderBase]: For 223187/223220 co-relation queries the response was YES. [2024-06-27 22:46:39,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77231 conditions, 11237 events. 7541/11237 cut-off events. For 223187/223220 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 65430 event pairs, 1124 based on Foata normal form. 31/11071 useless extension candidates. Maximal degree in co-relation 77132. Up to 10145 conditions per place. [2024-06-27 22:46:39,668 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 569 selfloop transitions, 65 changer transitions 0/640 dead transitions. [2024-06-27 22:46:39,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 640 transitions, 9480 flow [2024-06-27 22:46:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-06-27 22:46:39,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5558510638297872 [2024-06-27 22:46:39,670 INFO L175 Difference]: Start difference. First operand has 216 places, 559 transitions, 7718 flow. Second operand 8 states and 209 transitions. [2024-06-27 22:46:39,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 640 transitions, 9480 flow [2024-06-27 22:46:40,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 640 transitions, 9423 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:40,397 INFO L231 Difference]: Finished difference. Result has 222 places, 565 transitions, 7955 flow [2024-06-27 22:46:40,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7661, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7955, PETRI_PLACES=222, PETRI_TRANSITIONS=565} [2024-06-27 22:46:40,398 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 169 predicate places. [2024-06-27 22:46:40,398 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 565 transitions, 7955 flow [2024-06-27 22:46:40,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:40,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:40,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:40,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:46:40,399 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:40,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash -609395818, now seen corresponding path program 1 times [2024-06-27 22:46:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720565962] [2024-06-27 22:46:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:48,149 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-27 22:46:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720565962] [2024-06-27 22:46:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720565962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:48,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984211235] [2024-06-27 22:46:48,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:48,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:48,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:48,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:48,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:48,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:46:48,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 565 transitions, 7955 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:48,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:48,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:46:48,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:52,892 INFO L124 PetriNetUnfolderBase]: 8307/12373 cut-off events. [2024-06-27 22:46:52,892 INFO L125 PetriNetUnfolderBase]: For 269509/269542 co-relation queries the response was YES. [2024-06-27 22:46:52,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86814 conditions, 12373 events. 8307/12373 cut-off events. For 269509/269542 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 73081 event pairs, 1399 based on Foata normal form. 35/12179 useless extension candidates. Maximal degree in co-relation 86713. Up to 9409 conditions per place. [2024-06-27 22:46:53,028 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 528 selfloop transitions, 149 changer transitions 0/683 dead transitions. [2024-06-27 22:46:53,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 683 transitions, 10550 flow [2024-06-27 22:46:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions. [2024-06-27 22:46:53,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5981087470449172 [2024-06-27 22:46:53,029 INFO L175 Difference]: Start difference. First operand has 222 places, 565 transitions, 7955 flow. Second operand 9 states and 253 transitions. [2024-06-27 22:46:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 683 transitions, 10550 flow [2024-06-27 22:46:53,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 683 transitions, 10416 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:53,633 INFO L231 Difference]: Finished difference. Result has 230 places, 581 transitions, 8516 flow [2024-06-27 22:46:53,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7821, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8516, PETRI_PLACES=230, PETRI_TRANSITIONS=581} [2024-06-27 22:46:53,634 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 177 predicate places. [2024-06-27 22:46:53,634 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 581 transitions, 8516 flow [2024-06-27 22:46:53,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:53,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:53,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:53,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:46:53,635 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:53,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash -609395942, now seen corresponding path program 2 times [2024-06-27 22:46:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:53,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736935479] [2024-06-27 22:46:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:00,780 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-27 22:47:00,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:00,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736935479] [2024-06-27 22:47:00,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736935479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:00,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:00,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859828285] [2024-06-27 22:47:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:00,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:00,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:00,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:00,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:47:00,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 581 transitions, 8516 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:00,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:00,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:47:00,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:05,213 INFO L124 PetriNetUnfolderBase]: 8357/12414 cut-off events. [2024-06-27 22:47:05,213 INFO L125 PetriNetUnfolderBase]: For 293720/293753 co-relation queries the response was YES. [2024-06-27 22:47:05,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90867 conditions, 12414 events. 8357/12414 cut-off events. For 293720/293753 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 73128 event pairs, 1524 based on Foata normal form. 31/12227 useless extension candidates. Maximal degree in co-relation 90761. Up to 11409 conditions per place. [2024-06-27 22:47:05,372 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 587 selfloop transitions, 62 changer transitions 0/655 dead transitions. [2024-06-27 22:47:05,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 655 transitions, 10098 flow [2024-06-27 22:47:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-06-27 22:47:05,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508274231678487 [2024-06-27 22:47:05,374 INFO L175 Difference]: Start difference. First operand has 230 places, 581 transitions, 8516 flow. Second operand 9 states and 215 transitions. [2024-06-27 22:47:05,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 655 transitions, 10098 flow [2024-06-27 22:47:06,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 655 transitions, 9909 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-27 22:47:06,499 INFO L231 Difference]: Finished difference. Result has 236 places, 583 transitions, 8512 flow [2024-06-27 22:47:06,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8327, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8512, PETRI_PLACES=236, PETRI_TRANSITIONS=583} [2024-06-27 22:47:06,499 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 183 predicate places. [2024-06-27 22:47:06,500 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 583 transitions, 8512 flow [2024-06-27 22:47:06,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:06,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:06,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:06,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:47:06,500 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:06,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -606599432, now seen corresponding path program 3 times [2024-06-27 22:47:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847843604] [2024-06-27 22:47:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:16,032 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-27 22:47:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847843604] [2024-06-27 22:47:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847843604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495592100] [2024-06-27 22:47:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:16,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:16,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:16,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:16,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:47:16,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 583 transitions, 8512 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:16,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:16,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:47:16,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:20,266 INFO L124 PetriNetUnfolderBase]: 8378/12644 cut-off events. [2024-06-27 22:47:20,266 INFO L125 PetriNetUnfolderBase]: For 295807/295840 co-relation queries the response was YES. [2024-06-27 22:47:20,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90785 conditions, 12644 events. 8378/12644 cut-off events. For 295807/295840 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 75982 event pairs, 1660 based on Foata normal form. 31/12390 useless extension candidates. Maximal degree in co-relation 90677. Up to 11490 conditions per place. [2024-06-27 22:47:20,419 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 593 selfloop transitions, 58 changer transitions 0/657 dead transitions. [2024-06-27 22:47:20,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 657 transitions, 10161 flow [2024-06-27 22:47:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2024-06-27 22:47:20,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49645390070921985 [2024-06-27 22:47:20,420 INFO L175 Difference]: Start difference. First operand has 236 places, 583 transitions, 8512 flow. Second operand 9 states and 210 transitions. [2024-06-27 22:47:20,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 657 transitions, 10161 flow [2024-06-27 22:47:21,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 657 transitions, 10014 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 22:47:21,169 INFO L231 Difference]: Finished difference. Result has 239 places, 591 transitions, 8682 flow [2024-06-27 22:47:21,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8365, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8682, PETRI_PLACES=239, PETRI_TRANSITIONS=591} [2024-06-27 22:47:21,170 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 186 predicate places. [2024-06-27 22:47:21,170 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 591 transitions, 8682 flow [2024-06-27 22:47:21,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:21,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:21,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:21,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:47:21,170 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:21,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash -606599308, now seen corresponding path program 2 times [2024-06-27 22:47:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:21,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101164289] [2024-06-27 22:47:21,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:21,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:31,864 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-27 22:47:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101164289] [2024-06-27 22:47:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101164289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644171861] [2024-06-27 22:47:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:31,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:31,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:47:31,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 591 transitions, 8682 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:31,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:31,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:47:31,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:36,740 INFO L124 PetriNetUnfolderBase]: 8832/13312 cut-off events. [2024-06-27 22:47:36,741 INFO L125 PetriNetUnfolderBase]: For 333412/333445 co-relation queries the response was YES. [2024-06-27 22:47:36,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97337 conditions, 13312 events. 8832/13312 cut-off events. For 333412/333445 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 80446 event pairs, 1649 based on Foata normal form. 35/13046 useless extension candidates. Maximal degree in co-relation 97227. Up to 10981 conditions per place. [2024-06-27 22:47:36,921 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 510 selfloop transitions, 176 changer transitions 0/692 dead transitions. [2024-06-27 22:47:36,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 692 transitions, 11073 flow [2024-06-27 22:47:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:47:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:47:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 252 transitions. [2024-06-27 22:47:36,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361702127659574 [2024-06-27 22:47:36,922 INFO L175 Difference]: Start difference. First operand has 239 places, 591 transitions, 8682 flow. Second operand 10 states and 252 transitions. [2024-06-27 22:47:36,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 692 transitions, 11073 flow [2024-06-27 22:47:37,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 692 transitions, 10884 flow, removed 64 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:37,828 INFO L231 Difference]: Finished difference. Result has 246 places, 602 transitions, 9136 flow [2024-06-27 22:47:37,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8493, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9136, PETRI_PLACES=246, PETRI_TRANSITIONS=602} [2024-06-27 22:47:37,829 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 193 predicate places. [2024-06-27 22:47:37,829 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 602 transitions, 9136 flow [2024-06-27 22:47:37,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:37,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:37,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:37,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:47:37,830 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:37,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:37,830 INFO L85 PathProgramCache]: Analyzing trace with hash 730990634, now seen corresponding path program 3 times [2024-06-27 22:47:37,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:37,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240614049] [2024-06-27 22:47:37,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:49,034 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-27 22:47:49,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:49,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240614049] [2024-06-27 22:47:49,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240614049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:49,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:49,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:49,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179188949] [2024-06-27 22:47:49,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:49,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:49,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:49,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:49,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:47:49,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 602 transitions, 9136 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:49,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:49,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:47:49,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:53,895 INFO L124 PetriNetUnfolderBase]: 8954/13493 cut-off events. [2024-06-27 22:47:53,895 INFO L125 PetriNetUnfolderBase]: For 357261/357294 co-relation queries the response was YES. [2024-06-27 22:47:54,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101684 conditions, 13493 events. 8954/13493 cut-off events. For 357261/357294 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 81707 event pairs, 1696 based on Foata normal form. 35/13222 useless extension candidates. Maximal degree in co-relation 101570. Up to 11405 conditions per place. [2024-06-27 22:47:54,071 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 512 selfloop transitions, 177 changer transitions 0/695 dead transitions. [2024-06-27 22:47:54,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 695 transitions, 11278 flow [2024-06-27 22:47:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:47:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:47:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-06-27 22:47:54,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297872340425532 [2024-06-27 22:47:54,073 INFO L175 Difference]: Start difference. First operand has 246 places, 602 transitions, 9136 flow. Second operand 10 states and 249 transitions. [2024-06-27 22:47:54,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 695 transitions, 11278 flow [2024-06-27 22:47:54,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 695 transitions, 10957 flow, removed 68 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:54,994 INFO L231 Difference]: Finished difference. Result has 252 places, 611 transitions, 9469 flow [2024-06-27 22:47:54,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8847, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9469, PETRI_PLACES=252, PETRI_TRANSITIONS=611} [2024-06-27 22:47:54,995 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 199 predicate places. [2024-06-27 22:47:54,995 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 611 transitions, 9469 flow [2024-06-27 22:47:54,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:54,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:54,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:54,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:47:54,995 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:54,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash -491303488, now seen corresponding path program 4 times [2024-06-27 22:47:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773897747] [2024-06-27 22:47:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:54,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:02,388 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-27 22:48:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773897747] [2024-06-27 22:48:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773897747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:02,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148067195] [2024-06-27 22:48:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:02,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:02,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:48:02,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 611 transitions, 9469 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:02,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:02,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:48:02,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:07,543 INFO L124 PetriNetUnfolderBase]: 9584/14395 cut-off events. [2024-06-27 22:48:07,543 INFO L125 PetriNetUnfolderBase]: For 410301/410301 co-relation queries the response was YES. [2024-06-27 22:48:07,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111514 conditions, 14395 events. 9584/14395 cut-off events. For 410301/410301 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 87607 event pairs, 1769 based on Foata normal form. 3/14087 useless extension candidates. Maximal degree in co-relation 111397. Up to 11593 conditions per place. [2024-06-27 22:48:07,712 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 480 selfloop transitions, 217 changer transitions 0/703 dead transitions. [2024-06-27 22:48:07,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 703 transitions, 11724 flow [2024-06-27 22:48:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-27 22:48:07,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366430260047281 [2024-06-27 22:48:07,713 INFO L175 Difference]: Start difference. First operand has 252 places, 611 transitions, 9469 flow. Second operand 9 states and 227 transitions. [2024-06-27 22:48:07,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 703 transitions, 11724 flow [2024-06-27 22:48:08,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 703 transitions, 11461 flow, removed 57 selfloop flow, removed 5 redundant places. [2024-06-27 22:48:08,937 INFO L231 Difference]: Finished difference. Result has 257 places, 629 transitions, 10139 flow [2024-06-27 22:48:08,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=9209, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10139, PETRI_PLACES=257, PETRI_TRANSITIONS=629} [2024-06-27 22:48:08,937 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 204 predicate places. [2024-06-27 22:48:08,938 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 629 transitions, 10139 flow [2024-06-27 22:48:08,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:08,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:08,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:08,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:48:08,938 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:08,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash -491130508, now seen corresponding path program 5 times [2024-06-27 22:48:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:08,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711660029] [2024-06-27 22:48:08,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:15,760 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-27 22:48:15,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711660029] [2024-06-27 22:48:15,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711660029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:15,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:15,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:15,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240373823] [2024-06-27 22:48:15,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:15,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:15,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:15,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:15,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:15,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:48:15,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 629 transitions, 10139 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:15,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:15,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:48:15,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:20,975 INFO L124 PetriNetUnfolderBase]: 10199/15336 cut-off events. [2024-06-27 22:48:20,975 INFO L125 PetriNetUnfolderBase]: For 462702/462702 co-relation queries the response was YES. [2024-06-27 22:48:21,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123787 conditions, 15336 events. 10199/15336 cut-off events. For 462702/462702 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 94207 event pairs, 2017 based on Foata normal form. 8/15000 useless extension candidates. Maximal degree in co-relation 123667. Up to 13362 conditions per place. [2024-06-27 22:48:21,175 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 639 selfloop transitions, 112 changer transitions 0/757 dead transitions. [2024-06-27 22:48:21,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 757 transitions, 12861 flow [2024-06-27 22:48:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-27 22:48:21,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5437352245862884 [2024-06-27 22:48:21,177 INFO L175 Difference]: Start difference. First operand has 257 places, 629 transitions, 10139 flow. Second operand 9 states and 230 transitions. [2024-06-27 22:48:21,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 757 transitions, 12861 flow [2024-06-27 22:48:22,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 757 transitions, 12668 flow, removed 90 selfloop flow, removed 1 redundant places. [2024-06-27 22:48:22,669 INFO L231 Difference]: Finished difference. Result has 268 places, 674 transitions, 11124 flow [2024-06-27 22:48:22,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=9952, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11124, PETRI_PLACES=268, PETRI_TRANSITIONS=674} [2024-06-27 22:48:22,670 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 215 predicate places. [2024-06-27 22:48:22,670 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 674 transitions, 11124 flow [2024-06-27 22:48:22,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:22,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:22,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:22,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:48:22,671 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:22,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash -491308262, now seen corresponding path program 4 times [2024-06-27 22:48:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364291622] [2024-06-27 22:48:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:30,040 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-27 22:48:30,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364291622] [2024-06-27 22:48:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364291622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:30,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:30,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68981756] [2024-06-27 22:48:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:30,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:30,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:48:30,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 674 transitions, 11124 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:30,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:30,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:48:30,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:35,344 INFO L124 PetriNetUnfolderBase]: 10483/15704 cut-off events. [2024-06-27 22:48:35,344 INFO L125 PetriNetUnfolderBase]: For 503152/503152 co-relation queries the response was YES. [2024-06-27 22:48:35,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132346 conditions, 15704 events. 10483/15704 cut-off events. For 503152/503152 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 96354 event pairs, 1869 based on Foata normal form. 4/15373 useless extension candidates. Maximal degree in co-relation 132220. Up to 13001 conditions per place. [2024-06-27 22:48:35,567 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 570 selfloop transitions, 195 changer transitions 0/771 dead transitions. [2024-06-27 22:48:35,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 771 transitions, 13584 flow [2024-06-27 22:48:35,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:48:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:48:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-27 22:48:35,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-06-27 22:48:35,568 INFO L175 Difference]: Start difference. First operand has 268 places, 674 transitions, 11124 flow. Second operand 8 states and 208 transitions. [2024-06-27 22:48:35,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 771 transitions, 13584 flow [2024-06-27 22:48:37,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 771 transitions, 13291 flow, removed 132 selfloop flow, removed 3 redundant places. [2024-06-27 22:48:37,358 INFO L231 Difference]: Finished difference. Result has 274 places, 701 transitions, 12055 flow [2024-06-27 22:48:37,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=10831, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12055, PETRI_PLACES=274, PETRI_TRANSITIONS=701} [2024-06-27 22:48:37,359 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 221 predicate places. [2024-06-27 22:48:37,359 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 701 transitions, 12055 flow [2024-06-27 22:48:37,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:37,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:37,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:37,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:48:37,359 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:37,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 846461480, now seen corresponding path program 1 times [2024-06-27 22:48:37,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551692264] [2024-06-27 22:48:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:45,179 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-27 22:48:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:45,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551692264] [2024-06-27 22:48:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551692264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:45,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:45,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:45,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419478683] [2024-06-27 22:48:45,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:45,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:45,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:45,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:45,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:48:45,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 701 transitions, 12055 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:45,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:45,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:48:45,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:51,493 INFO L124 PetriNetUnfolderBase]: 10770/16218 cut-off events. [2024-06-27 22:48:51,494 INFO L125 PetriNetUnfolderBase]: For 557300/557338 co-relation queries the response was YES. [2024-06-27 22:48:51,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139645 conditions, 16218 events. 10770/16218 cut-off events. For 557300/557338 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 100484 event pairs, 1956 based on Foata normal form. 27/15869 useless extension candidates. Maximal degree in co-relation 139516. Up to 13850 conditions per place. [2024-06-27 22:48:51,718 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 655 selfloop transitions, 166 changer transitions 0/827 dead transitions. [2024-06-27 22:48:51,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 827 transitions, 14821 flow [2024-06-27 22:48:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:48:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:48:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 256 transitions. [2024-06-27 22:48:51,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951644100580271 [2024-06-27 22:48:51,720 INFO L175 Difference]: Start difference. First operand has 274 places, 701 transitions, 12055 flow. Second operand 11 states and 256 transitions. [2024-06-27 22:48:51,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 827 transitions, 14821 flow [2024-06-27 22:48:54,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 827 transitions, 14720 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-06-27 22:48:54,094 INFO L231 Difference]: Finished difference. Result has 282 places, 719 transitions, 12896 flow [2024-06-27 22:48:54,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=11954, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12896, PETRI_PLACES=282, PETRI_TRANSITIONS=719} [2024-06-27 22:48:54,095 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 229 predicate places. [2024-06-27 22:48:54,095 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 719 transitions, 12896 flow [2024-06-27 22:48:54,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:54,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:54,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:54,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:48:54,096 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:54,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash -491123564, now seen corresponding path program 1 times [2024-06-27 22:48:54,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:54,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883280634] [2024-06-27 22:48:54,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:54,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:03,232 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-27 22:49:03,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:03,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883280634] [2024-06-27 22:49:03,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883280634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:03,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:03,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:03,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943429909] [2024-06-27 22:49:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:03,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:03,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:03,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:03,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:49:03,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 719 transitions, 12896 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:03,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:03,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:49:03,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:09,196 INFO L124 PetriNetUnfolderBase]: 11048/16658 cut-off events. [2024-06-27 22:49:09,196 INFO L125 PetriNetUnfolderBase]: For 609486/609524 co-relation queries the response was YES. [2024-06-27 22:49:09,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145913 conditions, 16658 events. 11048/16658 cut-off events. For 609486/609524 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 103897 event pairs, 1963 based on Foata normal form. 33/16305 useless extension candidates. Maximal degree in co-relation 145782. Up to 14188 conditions per place. [2024-06-27 22:49:09,767 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 680 selfloop transitions, 143 changer transitions 0/829 dead transitions. [2024-06-27 22:49:09,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 829 transitions, 15206 flow [2024-06-27 22:49:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:49:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:49:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2024-06-27 22:49:09,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4990328820116054 [2024-06-27 22:49:09,769 INFO L175 Difference]: Start difference. First operand has 282 places, 719 transitions, 12896 flow. Second operand 11 states and 258 transitions. [2024-06-27 22:49:09,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 829 transitions, 15206 flow [2024-06-27 22:49:11,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 829 transitions, 14783 flow, removed 85 selfloop flow, removed 8 redundant places. [2024-06-27 22:49:11,738 INFO L231 Difference]: Finished difference. Result has 285 places, 721 transitions, 12861 flow [2024-06-27 22:49:11,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=12473, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12861, PETRI_PLACES=285, PETRI_TRANSITIONS=721} [2024-06-27 22:49:11,738 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 232 predicate places. [2024-06-27 22:49:11,738 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 721 transitions, 12861 flow [2024-06-27 22:49:11,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:11,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:11,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:11,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:49:11,739 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:11,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash 846277154, now seen corresponding path program 6 times [2024-06-27 22:49:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:11,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859338210] [2024-06-27 22:49:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:18,486 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-27 22:49:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859338210] [2024-06-27 22:49:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859338210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:18,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:18,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:49:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356202669] [2024-06-27 22:49:18,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:49:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:49:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:49:18,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:49:18,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 721 transitions, 12861 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:18,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:18,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:49:18,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:24,932 INFO L124 PetriNetUnfolderBase]: 11485/17264 cut-off events. [2024-06-27 22:49:24,932 INFO L125 PetriNetUnfolderBase]: For 635206/635206 co-relation queries the response was YES. [2024-06-27 22:49:25,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152242 conditions, 17264 events. 11485/17264 cut-off events. For 635206/635206 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 107914 event pairs, 2203 based on Foata normal form. 8/16885 useless extension candidates. Maximal degree in co-relation 152110. Up to 14727 conditions per place. [2024-06-27 22:49:25,264 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 666 selfloop transitions, 143 changer transitions 0/815 dead transitions. [2024-06-27 22:49:25,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 815 transitions, 15789 flow [2024-06-27 22:49:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:49:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:49:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-27 22:49:25,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5437352245862884 [2024-06-27 22:49:25,265 INFO L175 Difference]: Start difference. First operand has 285 places, 721 transitions, 12861 flow. Second operand 9 states and 230 transitions. [2024-06-27 22:49:25,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 815 transitions, 15789 flow [2024-06-27 22:49:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 815 transitions, 15469 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-27 22:49:27,357 INFO L231 Difference]: Finished difference. Result has 287 places, 732 transitions, 13196 flow [2024-06-27 22:49:27,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=12541, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13196, PETRI_PLACES=287, PETRI_TRANSITIONS=732} [2024-06-27 22:49:27,358 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 234 predicate places. [2024-06-27 22:49:27,358 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 732 transitions, 13196 flow [2024-06-27 22:49:27,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:27,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:27,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:27,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:49:27,359 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:27,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash 534336660, now seen corresponding path program 2 times [2024-06-27 22:49:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:27,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659737964] [2024-06-27 22:49:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:27,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:36,599 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-27 22:49:36,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:36,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659737964] [2024-06-27 22:49:36,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659737964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:36,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:36,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:49:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716261937] [2024-06-27 22:49:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:36,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:49:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:36,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:49:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:49:36,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 22:49:36,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 732 transitions, 13196 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:36,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:36,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 22:49:36,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:43,762 INFO L124 PetriNetUnfolderBase]: 11763/17757 cut-off events. [2024-06-27 22:49:43,762 INFO L125 PetriNetUnfolderBase]: For 701171/701192 co-relation queries the response was YES. [2024-06-27 22:49:43,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157552 conditions, 17757 events. 11763/17757 cut-off events. For 701171/701192 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 112131 event pairs, 2188 based on Foata normal form. 32/17373 useless extension candidates. Maximal degree in co-relation 157417. Up to 15790 conditions per place. [2024-06-27 22:49:43,997 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 726 selfloop transitions, 80 changer transitions 0/812 dead transitions. [2024-06-27 22:49:43,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 812 transitions, 15313 flow [2024-06-27 22:49:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2024-06-27 22:49:43,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-06-27 22:49:43,998 INFO L175 Difference]: Start difference. First operand has 287 places, 732 transitions, 13196 flow. Second operand 10 states and 230 transitions. [2024-06-27 22:49:43,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 812 transitions, 15313 flow