./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe003_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/safe003_power.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe003_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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 00:09:22,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:09:22,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:09:22,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:09:22,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:09:22,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:09:22,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:09:22,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:09:22,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:09:22,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:09:22,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:09:22,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:09:22,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:09:22,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:09:22,636 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:09:22,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:09:22,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:09:22,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:09:22,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:09:22,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:09:22,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:09:22,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:09:22,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:09:22,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:09:22,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:09:22,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:09:22,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:09:22,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:09:22,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:09:22,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:09:22,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:09:22,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:09:22,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:09:22,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:09:22,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:09:22,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:09:22,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:09:22,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:09:22,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:09:22,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:09:22,642 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:09:22,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:09:22,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:09:22,642 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-28 00:09:22,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:09:22,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:09:22,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:09:22,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:09:22,902 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:09:22,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2024-06-28 00:09:23,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:09:24,133 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:09:24,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2024-06-28 00:09:24,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642a964a8/779c1c227bb64a3384a3c4b6df955a4b/FLAGc84583c0a [2024-06-28 00:09:24,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642a964a8/779c1c227bb64a3384a3c4b6df955a4b [2024-06-28 00:09:24,487 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:09:24,488 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:09:24,488 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/safe003_power.opt.yml/witness.yml [2024-06-28 00:09:24,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:09:24,549 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:09:24,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:09:24,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:09:24,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:09:24,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:09:24" (1/2) ... [2024-06-28 00:09:24,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bdac41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:24, skipping insertion in model container [2024-06-28 00:09:24,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:09:24" (1/2) ... [2024-06-28 00:09:24,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f04e245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:09:24, skipping insertion in model container [2024-06-28 00:09:24,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:09:24" (2/2) ... [2024-06-28 00:09:24,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bdac41 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:24, skipping insertion in model container [2024-06-28 00:09:24,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:09:24" (2/2) ... [2024-06-28 00:09:24,557 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:09:24,573 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:09:24,574 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ! 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_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 )__unbuffered_p2_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (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) && (3LL - (long long )x) - (long long )y >= 0LL) && (3LL - (long long )x$mem_tmp) - (long long )y >= 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-28 00:09:24,574 INFO L97 edCorrectnessWitness]: Location invariant before [L858-L858] ! 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_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 )__unbuffered_p2_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (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) && (3LL - (long long )x) - (long long )y >= 0LL) && (3LL - (long long )x$mem_tmp) - (long long )y >= 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-28 00:09:24,574 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ! 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_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 )__unbuffered_p2_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )x$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (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) && (3LL - (long long )x) - (long long )y >= 0LL) && (3LL - (long long )x$mem_tmp) - (long long )y >= 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-28 00:09:24,575 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:09:24,575 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-28 00:09:24,618 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:09:24,901 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:09:24,913 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:09:25,274 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:09:25,324 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:09:25,329 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25 WrapperNode [2024-06-28 00:09:25,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:09:25,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:09:25,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:09:25,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:09:25,337 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 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,364 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 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,425 INFO L138 Inliner]: procedures = 175, calls = 269, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 803 [2024-06-28 00:09:25,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:09:25,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:09:25,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:09:25,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:09:25,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,533 INFO L175 MemorySlicer]: Split 227 memory accesses to 2 slices as follows [225, 2]. 99 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 6 writes are split as follows [6, 0]. [2024-06-28 00:09:25,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:09:25,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:09:25,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:09:25,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:09:25,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (1/1) ... [2024-06-28 00:09:25,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:09:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:09:25,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 00:09:25,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 00:09:25,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 00:09:25,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 00:09:25,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 00:09:25,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 00:09:25,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:09:25,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:09:25,694 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 00:09:25,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 00:09:25,695 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 00:09:25,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 00:09:25,695 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 00:09:25,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 00:09:25,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:09:25,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 00:09:25,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:09:25,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:09:25,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:09:25,697 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:09:25,833 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:09:25,835 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:09:26,809 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:09:26,809 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:09:29,447 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:09:29,447 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:09:29,448 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:09:29 BoogieIcfgContainer [2024-06-28 00:09:29,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:09:29,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:09:29,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:09:29,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:09:29,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:09:24" (1/4) ... [2024-06-28 00:09:29,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbcb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:09:29, skipping insertion in model container [2024-06-28 00:09:29,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:09:24" (2/4) ... [2024-06-28 00:09:29,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbcb3f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:09:29, skipping insertion in model container [2024-06-28 00:09:29,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:09:25" (3/4) ... [2024-06-28 00:09:29,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbcb3f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:09:29, skipping insertion in model container [2024-06-28 00:09:29,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:09:29" (4/4) ... [2024-06-28 00:09:29,458 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2024-06-28 00:09:29,472 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:09:29,473 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 00:09:29,473 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:09:29,541 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 00:09:29,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-28 00:09:29,601 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-28 00:09:29,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:09:29,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 00:09:29,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-28 00:09:29,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-28 00:09:29,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:09:29,617 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;@7cb8e1e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:09:29,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-28 00:09:29,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:09:29,623 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 00:09:29,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:09:29,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:29,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:09:29,624 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:09:29,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1897094882, now seen corresponding path program 1 times [2024-06-28 00:09:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:29,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702462554] [2024-06-28 00:09:29,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:29,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:09:35,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702462554] [2024-06-28 00:09:35,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702462554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:35,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:35,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:09:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068050086] [2024-06-28 00:09:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:35,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:09:35,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:09:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:09:35,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-28 00:09:35,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:35,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:35,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-28 00:09:35,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:36,432 INFO L124 PetriNetUnfolderBase]: 1217/1862 cut-off events. [2024-06-28 00:09:36,432 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-06-28 00:09:36,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3809 conditions, 1862 events. 1217/1862 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8717 event pairs, 713 based on Foata normal form. 2/1817 useless extension candidates. Maximal degree in co-relation 3797. Up to 1843 conditions per place. [2024-06-28 00:09:36,446 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 36 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-06-28 00:09:36,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 187 flow [2024-06-28 00:09:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:09:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:09:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-28 00:09:36,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-28 00:09:36,457 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 70 transitions. [2024-06-28 00:09:36,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 187 flow [2024-06-28 00:09:36,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 00:09:36,463 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-28 00:09:36,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-28 00:09:36,467 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-28 00:09:36,467 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-28 00:09:36,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:36,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:36,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:36,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:09:36,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:09:36,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:36,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2042117665, now seen corresponding path program 1 times [2024-06-28 00:09:36,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:36,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357787451] [2024-06-28 00:09:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:36,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:09:40,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:40,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357787451] [2024-06-28 00:09:40,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357787451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:40,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:40,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:09:40,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618231831] [2024-06-28 00:09:40,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:40,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:09:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:09:40,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:09:40,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-28 00:09:40,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:40,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:40,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-28 00:09:40,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:41,471 INFO L124 PetriNetUnfolderBase]: 1709/2563 cut-off events. [2024-06-28 00:09:41,472 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-06-28 00:09:41,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5867 conditions, 2563 events. 1709/2563 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11626 event pairs, 1050 based on Foata normal form. 3/2564 useless extension candidates. Maximal degree in co-relation 5855. Up to 2530 conditions per place. [2024-06-28 00:09:41,484 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 49 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2024-06-28 00:09:41,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 278 flow [2024-06-28 00:09:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:09:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:09:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-06-28 00:09:41,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 00:09:41,488 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 84 transitions. [2024-06-28 00:09:41,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 278 flow [2024-06-28 00:09:41,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:09:41,491 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 154 flow [2024-06-28 00:09:41,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-06-28 00:09:41,492 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-06-28 00:09:41,492 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 154 flow [2024-06-28 00:09:41,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:41,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:41,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:41,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:09:41,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:09:41,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1118859590, now seen corresponding path program 1 times [2024-06-28 00:09:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579705406] [2024-06-28 00:09:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:09:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579705406] [2024-06-28 00:09:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579705406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:45,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:09:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407402515] [2024-06-28 00:09:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:45,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:09:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:09:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:09:45,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-28 00:09:45,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:45,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:45,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-28 00:09:45,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:46,388 INFO L124 PetriNetUnfolderBase]: 1703/2554 cut-off events. [2024-06-28 00:09:46,388 INFO L125 PetriNetUnfolderBase]: For 1251/1251 co-relation queries the response was YES. [2024-06-28 00:09:46,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6489 conditions, 2554 events. 1703/2554 cut-off events. For 1251/1251 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11560 event pairs, 899 based on Foata normal form. 3/2555 useless extension candidates. Maximal degree in co-relation 6474. Up to 2502 conditions per place. [2024-06-28 00:09:46,402 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 58 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2024-06-28 00:09:46,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 368 flow [2024-06-28 00:09:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:09:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:09:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-28 00:09:46,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-06-28 00:09:46,404 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 154 flow. Second operand 5 states and 103 transitions. [2024-06-28 00:09:46,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 368 flow [2024-06-28 00:09:46,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 366 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-28 00:09:46,406 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 200 flow [2024-06-28 00:09:46,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-28 00:09:46,407 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-06-28 00:09:46,407 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 200 flow [2024-06-28 00:09:46,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:46,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:46,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:46,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:09:46,408 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:09:46,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash -324906656, now seen corresponding path program 1 times [2024-06-28 00:09:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216021965] [2024-06-28 00:09:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:09:50,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:50,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216021965] [2024-06-28 00:09:50,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216021965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:50,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:50,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:09:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430186350] [2024-06-28 00:09:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:50,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:09:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:50,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:09:50,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:09:50,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-06-28 00:09:50,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:50,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:50,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-06-28 00:09:50,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:51,695 INFO L124 PetriNetUnfolderBase]: 1697/2545 cut-off events. [2024-06-28 00:09:51,696 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2024-06-28 00:09:51,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7103 conditions, 2545 events. 1697/2545 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11520 event pairs, 748 based on Foata normal form. 3/2546 useless extension candidates. Maximal degree in co-relation 7085. Up to 2474 conditions per place. [2024-06-28 00:09:51,708 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 67 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2024-06-28 00:09:51,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 464 flow [2024-06-28 00:09:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:09:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:09:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-28 00:09:51,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-28 00:09:51,710 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 200 flow. Second operand 6 states and 122 transitions. [2024-06-28 00:09:51,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 464 flow [2024-06-28 00:09:51,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 442 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 00:09:51,716 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 236 flow [2024-06-28 00:09:51,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-28 00:09:51,718 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-06-28 00:09:51,718 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 236 flow [2024-06-28 00:09:51,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:51,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:51,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:51,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:09:51,719 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:09:51,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1482169447, now seen corresponding path program 1 times [2024-06-28 00:09:51,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:51,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232422967] [2024-06-28 00:09:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:51,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:09:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:09:56,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:09:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232422967] [2024-06-28 00:09:56,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232422967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:09:56,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:09:56,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:09:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728020435] [2024-06-28 00:09:56,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:09:56,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:09:56,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:09:56,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:09:56,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:09:56,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:09:56,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 236 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:56,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:09:56,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:09:56,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:09:57,185 INFO L124 PetriNetUnfolderBase]: 1688/2530 cut-off events. [2024-06-28 00:09:57,186 INFO L125 PetriNetUnfolderBase]: For 3540/3540 co-relation queries the response was YES. [2024-06-28 00:09:57,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7627 conditions, 2530 events. 1688/2530 cut-off events. For 3540/3540 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11409 event pairs, 579 based on Foata normal form. 6/2534 useless extension candidates. Maximal degree in co-relation 7607. Up to 2421 conditions per place. [2024-06-28 00:09:57,200 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 72 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2024-06-28 00:09:57,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 522 flow [2024-06-28 00:09:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:09:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:09:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 00:09:57,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 00:09:57,208 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 236 flow. Second operand 8 states and 136 transitions. [2024-06-28 00:09:57,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 522 flow [2024-06-28 00:09:57,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 490 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 00:09:57,218 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 255 flow [2024-06-28 00:09:57,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=255, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-06-28 00:09:57,221 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-06-28 00:09:57,221 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 255 flow [2024-06-28 00:09:57,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:09:57,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:09:57,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:09:57,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:09:57,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:09:57,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:09:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -203612684, now seen corresponding path program 1 times [2024-06-28 00:09:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:09:57,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112562926] [2024-06-28 00:09:57,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:09:57,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:09:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112562926] [2024-06-28 00:10:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112562926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:02,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:10:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626195982] [2024-06-28 00:10:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:02,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:10:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:02,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:10:02,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:10:02,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-28 00:10:02,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:02,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:02,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-28 00:10:02,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:03,890 INFO L124 PetriNetUnfolderBase]: 1340/2089 cut-off events. [2024-06-28 00:10:03,890 INFO L125 PetriNetUnfolderBase]: For 4185/4233 co-relation queries the response was YES. [2024-06-28 00:10:03,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 2089 events. 1340/2089 cut-off events. For 4185/4233 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9951 event pairs, 506 based on Foata normal form. 4/2011 useless extension candidates. Maximal degree in co-relation 6537. Up to 1959 conditions per place. [2024-06-28 00:10:03,905 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 47 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-28 00:10:03,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 431 flow [2024-06-28 00:10:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:10:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:10:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-28 00:10:03,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-28 00:10:03,907 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 255 flow. Second operand 5 states and 92 transitions. [2024-06-28 00:10:03,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 431 flow [2024-06-28 00:10:03,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 386 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-28 00:10:03,910 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 278 flow [2024-06-28 00:10:03,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-06-28 00:10:03,911 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-06-28 00:10:03,911 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 278 flow [2024-06-28 00:10:03,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:03,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:03,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:03,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:10:03,912 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:03,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2057240647, now seen corresponding path program 1 times [2024-06-28 00:10:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:03,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038077165] [2024-06-28 00:10:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038077165] [2024-06-28 00:10:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038077165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:10,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:10:10,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487879176] [2024-06-28 00:10:10,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:10,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:10:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:10:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:10:10,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:10:10,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:10,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:10,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:10:10,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:11,327 INFO L124 PetriNetUnfolderBase]: 1696/2547 cut-off events. [2024-06-28 00:10:11,328 INFO L125 PetriNetUnfolderBase]: For 6366/6376 co-relation queries the response was YES. [2024-06-28 00:10:11,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8573 conditions, 2547 events. 1696/2547 cut-off events. For 6366/6376 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11423 event pairs, 582 based on Foata normal form. 16/2560 useless extension candidates. Maximal degree in co-relation 8548. Up to 2400 conditions per place. [2024-06-28 00:10:11,345 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 66 selfloop transitions, 19 changer transitions 0/88 dead transitions. [2024-06-28 00:10:11,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 589 flow [2024-06-28 00:10:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:10:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:10:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-28 00:10:11,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-28 00:10:11,347 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 278 flow. Second operand 6 states and 105 transitions. [2024-06-28 00:10:11,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 589 flow [2024-06-28 00:10:11,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 00:10:11,352 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 396 flow [2024-06-28 00:10:11,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2024-06-28 00:10:11,354 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-28 00:10:11,354 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 396 flow [2024-06-28 00:10:11,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:11,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:11,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:11,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:10:11,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:11,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1723290513, now seen corresponding path program 1 times [2024-06-28 00:10:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:11,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209357043] [2024-06-28 00:10:11,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:11,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209357043] [2024-06-28 00:10:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209357043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:16,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:10:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142558221] [2024-06-28 00:10:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:16,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:10:16,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:10:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:10:16,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:10:16,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:16,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:16,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:10:16,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:18,287 INFO L124 PetriNetUnfolderBase]: 1742/2621 cut-off events. [2024-06-28 00:10:18,287 INFO L125 PetriNetUnfolderBase]: For 8769/8775 co-relation queries the response was YES. [2024-06-28 00:10:18,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9857 conditions, 2621 events. 1742/2621 cut-off events. For 8769/8775 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11781 event pairs, 629 based on Foata normal form. 6/2618 useless extension candidates. Maximal degree in co-relation 9827. Up to 2429 conditions per place. [2024-06-28 00:10:18,302 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 72 selfloop transitions, 26 changer transitions 0/101 dead transitions. [2024-06-28 00:10:18,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 796 flow [2024-06-28 00:10:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:10:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:10:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-28 00:10:18,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-28 00:10:18,304 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 396 flow. Second operand 6 states and 110 transitions. [2024-06-28 00:10:18,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 796 flow [2024-06-28 00:10:18,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 778 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-06-28 00:10:18,311 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 557 flow [2024-06-28 00:10:18,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=557, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2024-06-28 00:10:18,312 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2024-06-28 00:10:18,312 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 557 flow [2024-06-28 00:10:18,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:18,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:18,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:18,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:10:18,313 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:18,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1937909519, now seen corresponding path program 2 times [2024-06-28 00:10:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:18,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349762582] [2024-06-28 00:10:18,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349762582] [2024-06-28 00:10:24,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349762582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:24,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:24,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:10:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104718261] [2024-06-28 00:10:24,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:24,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:10:24,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:10:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:10:24,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:10:24,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:24,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:24,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:10:24,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:26,342 INFO L124 PetriNetUnfolderBase]: 1727/2596 cut-off events. [2024-06-28 00:10:26,343 INFO L125 PetriNetUnfolderBase]: For 10324/10336 co-relation queries the response was YES. [2024-06-28 00:10:26,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10157 conditions, 2596 events. 1727/2596 cut-off events. For 10324/10336 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11647 event pairs, 606 based on Foata normal form. 16/2608 useless extension candidates. Maximal degree in co-relation 10120. Up to 2418 conditions per place. [2024-06-28 00:10:26,358 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 67 selfloop transitions, 33 changer transitions 0/103 dead transitions. [2024-06-28 00:10:26,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 103 transitions, 895 flow [2024-06-28 00:10:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:10:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:10:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 00:10:26,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3601190476190476 [2024-06-28 00:10:26,360 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 557 flow. Second operand 8 states and 121 transitions. [2024-06-28 00:10:26,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 103 transitions, 895 flow [2024-06-28 00:10:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 854 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 00:10:26,371 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 701 flow [2024-06-28 00:10:26,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=701, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2024-06-28 00:10:26,372 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2024-06-28 00:10:26,372 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 701 flow [2024-06-28 00:10:26,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:26,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:26,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:26,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:10:26,373 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:26,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash -79924907, now seen corresponding path program 3 times [2024-06-28 00:10:26,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:26,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912716033] [2024-06-28 00:10:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:31,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912716033] [2024-06-28 00:10:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912716033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:31,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:31,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:10:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36153256] [2024-06-28 00:10:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:31,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:10:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:10:31,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:10:31,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:10:31,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:31,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:31,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:10:31,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:32,932 INFO L124 PetriNetUnfolderBase]: 1770/2665 cut-off events. [2024-06-28 00:10:32,932 INFO L125 PetriNetUnfolderBase]: For 15253/15259 co-relation queries the response was YES. [2024-06-28 00:10:32,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11232 conditions, 2665 events. 1770/2665 cut-off events. For 15253/15259 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12058 event pairs, 623 based on Foata normal form. 6/2664 useless extension candidates. Maximal degree in co-relation 11191. Up to 2447 conditions per place. [2024-06-28 00:10:32,954 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 75 selfloop transitions, 42 changer transitions 0/120 dead transitions. [2024-06-28 00:10:32,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 120 transitions, 1082 flow [2024-06-28 00:10:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:10:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:10:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-28 00:10:32,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-28 00:10:32,956 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 701 flow. Second operand 7 states and 125 transitions. [2024-06-28 00:10:32,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 120 transitions, 1082 flow [2024-06-28 00:10:32,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 120 transitions, 991 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-28 00:10:32,974 INFO L231 Difference]: Finished difference. Result has 81 places, 90 transitions, 802 flow [2024-06-28 00:10:32,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=802, PETRI_PLACES=81, PETRI_TRANSITIONS=90} [2024-06-28 00:10:32,974 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2024-06-28 00:10:32,974 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 802 flow [2024-06-28 00:10:32,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:32,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:32,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:32,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:10:32,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:32,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1500702786, now seen corresponding path program 1 times [2024-06-28 00:10:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188229120] [2024-06-28 00:10:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:40,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188229120] [2024-06-28 00:10:40,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188229120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:40,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:40,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:10:40,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684851222] [2024-06-28 00:10:40,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:40,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:10:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:10:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:10:40,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:10:40,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 802 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:40,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:40,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:10:40,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:42,116 INFO L124 PetriNetUnfolderBase]: 1819/2735 cut-off events. [2024-06-28 00:10:42,117 INFO L125 PetriNetUnfolderBase]: For 16010/16010 co-relation queries the response was YES. [2024-06-28 00:10:42,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11470 conditions, 2735 events. 1819/2735 cut-off events. For 16010/16010 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12369 event pairs, 605 based on Foata normal form. 2/2732 useless extension candidates. Maximal degree in co-relation 11429. Up to 2453 conditions per place. [2024-06-28 00:10:42,140 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 90 selfloop transitions, 47 changer transitions 0/140 dead transitions. [2024-06-28 00:10:42,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 140 transitions, 1349 flow [2024-06-28 00:10:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:10:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:10:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-28 00:10:42,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-28 00:10:42,143 INFO L175 Difference]: Start difference. First operand has 81 places, 90 transitions, 802 flow. Second operand 7 states and 127 transitions. [2024-06-28 00:10:42,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 140 transitions, 1349 flow [2024-06-28 00:10:42,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 140 transitions, 1301 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 00:10:42,156 INFO L231 Difference]: Finished difference. Result has 88 places, 106 transitions, 1082 flow [2024-06-28 00:10:42,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1082, PETRI_PLACES=88, PETRI_TRANSITIONS=106} [2024-06-28 00:10:42,157 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2024-06-28 00:10:42,157 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 106 transitions, 1082 flow [2024-06-28 00:10:42,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:42,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:42,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:42,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:10:42,157 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:42,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1890133620, now seen corresponding path program 2 times [2024-06-28 00:10:42,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:42,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069220540] [2024-06-28 00:10:42,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:42,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:48,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:48,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069220540] [2024-06-28 00:10:48,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069220540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:48,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:48,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:10:48,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57922674] [2024-06-28 00:10:48,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:48,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:10:48,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:48,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:10:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:10:48,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:10:48,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 106 transitions, 1082 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:48,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:48,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:10:48,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:49,729 INFO L124 PetriNetUnfolderBase]: 1832/2750 cut-off events. [2024-06-28 00:10:49,730 INFO L125 PetriNetUnfolderBase]: For 20080/20080 co-relation queries the response was YES. [2024-06-28 00:10:49,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12837 conditions, 2750 events. 1832/2750 cut-off events. For 20080/20080 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12415 event pairs, 583 based on Foata normal form. 2/2749 useless extension candidates. Maximal degree in co-relation 12792. Up to 2518 conditions per place. [2024-06-28 00:10:49,745 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 88 selfloop transitions, 52 changer transitions 0/143 dead transitions. [2024-06-28 00:10:49,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 143 transitions, 1489 flow [2024-06-28 00:10:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:10:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:10:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-06-28 00:10:49,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-28 00:10:49,748 INFO L175 Difference]: Start difference. First operand has 88 places, 106 transitions, 1082 flow. Second operand 9 states and 147 transitions. [2024-06-28 00:10:49,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 143 transitions, 1489 flow [2024-06-28 00:10:49,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 143 transitions, 1463 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-06-28 00:10:49,768 INFO L231 Difference]: Finished difference. Result has 96 places, 109 transitions, 1205 flow [2024-06-28 00:10:49,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1205, PETRI_PLACES=96, PETRI_TRANSITIONS=109} [2024-06-28 00:10:49,769 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2024-06-28 00:10:49,769 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 109 transitions, 1205 flow [2024-06-28 00:10:49,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:49,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:49,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:49,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:10:49,770 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:49,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1328803110, now seen corresponding path program 3 times [2024-06-28 00:10:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674557473] [2024-06-28 00:10:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:55,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-28 00:10:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:55,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674557473] [2024-06-28 00:10:55,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674557473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:55,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:10:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13667237] [2024-06-28 00:10:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:55,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:10:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:10:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:10:55,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:10:55,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 109 transitions, 1205 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:55,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:55,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:10:55,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:56,955 INFO L124 PetriNetUnfolderBase]: 2174/3247 cut-off events. [2024-06-28 00:10:56,955 INFO L125 PetriNetUnfolderBase]: For 27730/27740 co-relation queries the response was YES. [2024-06-28 00:10:56,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15522 conditions, 3247 events. 2174/3247 cut-off events. For 27730/27740 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15012 event pairs, 587 based on Foata normal form. 16/3258 useless extension candidates. Maximal degree in co-relation 15474. Up to 2599 conditions per place. [2024-06-28 00:10:56,971 INFO L140 encePairwiseOnDemand]: 26/42 looper letters, 100 selfloop transitions, 80 changer transitions 0/183 dead transitions. [2024-06-28 00:10:56,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 183 transitions, 1978 flow [2024-06-28 00:10:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:10:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:10:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-28 00:10:56,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-28 00:10:56,973 INFO L175 Difference]: Start difference. First operand has 96 places, 109 transitions, 1205 flow. Second operand 10 states and 183 transitions. [2024-06-28 00:10:56,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 183 transitions, 1978 flow [2024-06-28 00:10:56,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 183 transitions, 1856 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 00:10:56,999 INFO L231 Difference]: Finished difference. Result has 102 places, 133 transitions, 1494 flow [2024-06-28 00:10:56,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=102, PETRI_TRANSITIONS=133} [2024-06-28 00:10:57,000 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-06-28 00:10:57,001 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 133 transitions, 1494 flow [2024-06-28 00:10:57,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:57,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:57,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:57,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:10:57,001 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:10:57,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:57,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1777080254, now seen corresponding path program 4 times [2024-06-28 00:10:57,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:57,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391227127] [2024-06-28 00:10:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391227127] [2024-06-28 00:11:02,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391227127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:02,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:02,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:11:02,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622985882] [2024-06-28 00:11:02,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:02,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:11:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:11:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:11:02,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:11:02,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 133 transitions, 1494 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:02,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:02,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:11:02,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:03,878 INFO L124 PetriNetUnfolderBase]: 2178/3251 cut-off events. [2024-06-28 00:11:03,879 INFO L125 PetriNetUnfolderBase]: For 36238/36238 co-relation queries the response was YES. [2024-06-28 00:11:03,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17781 conditions, 3251 events. 2178/3251 cut-off events. For 36238/36238 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14958 event pairs, 667 based on Foata normal form. 2/3251 useless extension candidates. Maximal degree in co-relation 17731. Up to 3165 conditions per place. [2024-06-28 00:11:03,897 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 136 selfloop transitions, 30 changer transitions 0/169 dead transitions. [2024-06-28 00:11:03,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 169 transitions, 1950 flow [2024-06-28 00:11:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-28 00:11:03,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-28 00:11:03,900 INFO L175 Difference]: Start difference. First operand has 102 places, 133 transitions, 1494 flow. Second operand 8 states and 129 transitions. [2024-06-28 00:11:03,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 169 transitions, 1950 flow [2024-06-28 00:11:03,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 169 transitions, 1778 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:03,945 INFO L231 Difference]: Finished difference. Result has 106 places, 137 transitions, 1446 flow [2024-06-28 00:11:03,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1446, PETRI_PLACES=106, PETRI_TRANSITIONS=137} [2024-06-28 00:11:03,945 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-06-28 00:11:03,945 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 137 transitions, 1446 flow [2024-06-28 00:11:03,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:03,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:03,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:03,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:11:03,946 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:03,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:03,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1328556846, now seen corresponding path program 1 times [2024-06-28 00:11:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:03,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961472099] [2024-06-28 00:11:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961472099] [2024-06-28 00:11:11,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961472099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:11,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:11,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:11,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657351085] [2024-06-28 00:11:11,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:11,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:11,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:11,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:11:11,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 137 transitions, 1446 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:11,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:11,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:11:11,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:13,535 INFO L124 PetriNetUnfolderBase]: 2190/3273 cut-off events. [2024-06-28 00:11:13,536 INFO L125 PetriNetUnfolderBase]: For 38669/38678 co-relation queries the response was YES. [2024-06-28 00:11:13,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17088 conditions, 3273 events. 2190/3273 cut-off events. For 38669/38678 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15027 event pairs, 607 based on Foata normal form. 16/3284 useless extension candidates. Maximal degree in co-relation 17036. Up to 3014 conditions per place. [2024-06-28 00:11:13,556 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 109 selfloop transitions, 52 changer transitions 0/164 dead transitions. [2024-06-28 00:11:13,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 164 transitions, 1861 flow [2024-06-28 00:11:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-28 00:11:13,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2024-06-28 00:11:13,559 INFO L175 Difference]: Start difference. First operand has 106 places, 137 transitions, 1446 flow. Second operand 8 states and 124 transitions. [2024-06-28 00:11:13,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 164 transitions, 1861 flow [2024-06-28 00:11:13,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 164 transitions, 1807 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:13,592 INFO L231 Difference]: Finished difference. Result has 109 places, 140 transitions, 1537 flow [2024-06-28 00:11:13,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1537, PETRI_PLACES=109, PETRI_TRANSITIONS=140} [2024-06-28 00:11:13,592 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-06-28 00:11:13,592 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 140 transitions, 1537 flow [2024-06-28 00:11:13,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:13,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:13,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:13,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:11:13,593 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:13,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 15426574, now seen corresponding path program 1 times [2024-06-28 00:11:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343932756] [2024-06-28 00:11:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:20,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:20,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343932756] [2024-06-28 00:11:20,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343932756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:20,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:20,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337580831] [2024-06-28 00:11:20,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:20,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:20,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:20,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:20,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:20,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:11:20,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 140 transitions, 1537 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:20,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:20,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:11:20,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:22,162 INFO L124 PetriNetUnfolderBase]: 2257/3373 cut-off events. [2024-06-28 00:11:22,162 INFO L125 PetriNetUnfolderBase]: For 43672/43680 co-relation queries the response was YES. [2024-06-28 00:11:22,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18230 conditions, 3373 events. 2257/3373 cut-off events. For 43672/43680 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15589 event pairs, 666 based on Foata normal form. 8/3376 useless extension candidates. Maximal degree in co-relation 18177. Up to 3020 conditions per place. [2024-06-28 00:11:22,181 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 124 selfloop transitions, 63 changer transitions 0/190 dead transitions. [2024-06-28 00:11:22,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 190 transitions, 2161 flow [2024-06-28 00:11:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 00:11:22,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-28 00:11:22,184 INFO L175 Difference]: Start difference. First operand has 109 places, 140 transitions, 1537 flow. Second operand 8 states and 147 transitions. [2024-06-28 00:11:22,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 190 transitions, 2161 flow [2024-06-28 00:11:22,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 190 transitions, 1999 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-28 00:11:22,222 INFO L231 Difference]: Finished difference. Result has 110 places, 147 transitions, 1590 flow [2024-06-28 00:11:22,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1590, PETRI_PLACES=110, PETRI_TRANSITIONS=147} [2024-06-28 00:11:22,223 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-28 00:11:22,223 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 147 transitions, 1590 flow [2024-06-28 00:11:22,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:22,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:22,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:22,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:11:22,223 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:22,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 722857001, now seen corresponding path program 1 times [2024-06-28 00:11:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978766078] [2024-06-28 00:11:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:31,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978766078] [2024-06-28 00:11:31,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978766078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:31,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:31,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:31,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337608117] [2024-06-28 00:11:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:31,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:31,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:11:31,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 147 transitions, 1590 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:31,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:31,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:11:31,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:32,615 INFO L124 PetriNetUnfolderBase]: 2265/3388 cut-off events. [2024-06-28 00:11:32,615 INFO L125 PetriNetUnfolderBase]: For 49537/49570 co-relation queries the response was YES. [2024-06-28 00:11:32,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18931 conditions, 3388 events. 2265/3388 cut-off events. For 49537/49570 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15774 event pairs, 645 based on Foata normal form. 28/3401 useless extension candidates. Maximal degree in co-relation 18879. Up to 3010 conditions per place. [2024-06-28 00:11:32,639 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 132 selfloop transitions, 54 changer transitions 0/189 dead transitions. [2024-06-28 00:11:32,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 189 transitions, 2218 flow [2024-06-28 00:11:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:11:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:11:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 00:11:32,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-28 00:11:32,642 INFO L175 Difference]: Start difference. First operand has 110 places, 147 transitions, 1590 flow. Second operand 7 states and 122 transitions. [2024-06-28 00:11:32,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 189 transitions, 2218 flow [2024-06-28 00:11:32,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 189 transitions, 2112 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-28 00:11:32,691 INFO L231 Difference]: Finished difference. Result has 114 places, 156 transitions, 1732 flow [2024-06-28 00:11:32,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1732, PETRI_PLACES=114, PETRI_TRANSITIONS=156} [2024-06-28 00:11:32,692 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-28 00:11:32,692 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 156 transitions, 1732 flow [2024-06-28 00:11:32,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:32,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:32,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:32,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:11:32,693 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:32,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash 15516784, now seen corresponding path program 2 times [2024-06-28 00:11:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:32,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261315779] [2024-06-28 00:11:32,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:41,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261315779] [2024-06-28 00:11:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261315779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:41,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:41,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:41,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146068654] [2024-06-28 00:11:41,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:41,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:41,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:41,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:41,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:11:41,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 156 transitions, 1732 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:41,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:41,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:11:41,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:43,386 INFO L124 PetriNetUnfolderBase]: 2260/3378 cut-off events. [2024-06-28 00:11:43,386 INFO L125 PetriNetUnfolderBase]: For 53870/53878 co-relation queries the response was YES. [2024-06-28 00:11:43,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19750 conditions, 3378 events. 2260/3378 cut-off events. For 53870/53878 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15693 event pairs, 641 based on Foata normal form. 8/3381 useless extension candidates. Maximal degree in co-relation 19695. Up to 3079 conditions per place. [2024-06-28 00:11:43,409 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 131 selfloop transitions, 61 changer transitions 0/195 dead transitions. [2024-06-28 00:11:43,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 195 transitions, 2257 flow [2024-06-28 00:11:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-28 00:11:43,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2024-06-28 00:11:43,414 INFO L175 Difference]: Start difference. First operand has 114 places, 156 transitions, 1732 flow. Second operand 8 states and 139 transitions. [2024-06-28 00:11:43,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 195 transitions, 2257 flow [2024-06-28 00:11:43,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 195 transitions, 2205 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 00:11:43,473 INFO L231 Difference]: Finished difference. Result has 119 places, 159 transitions, 1852 flow [2024-06-28 00:11:43,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1852, PETRI_PLACES=119, PETRI_TRANSITIONS=159} [2024-06-28 00:11:43,475 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2024-06-28 00:11:43,475 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 159 transitions, 1852 flow [2024-06-28 00:11:43,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:43,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:43,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:43,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:11:43,476 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:43,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1723383950, now seen corresponding path program 3 times [2024-06-28 00:11:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916038734] [2024-06-28 00:11:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:50,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916038734] [2024-06-28 00:11:50,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916038734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:50,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648503269] [2024-06-28 00:11:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:50,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:50,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:50,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:50,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:11:50,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 159 transitions, 1852 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:50,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:50,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:11:50,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:51,878 INFO L124 PetriNetUnfolderBase]: 2351/3506 cut-off events. [2024-06-28 00:11:51,878 INFO L125 PetriNetUnfolderBase]: For 60619/60619 co-relation queries the response was YES. [2024-06-28 00:11:51,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21372 conditions, 3506 events. 2351/3506 cut-off events. For 60619/60619 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16368 event pairs, 551 based on Foata normal form. 2/3506 useless extension candidates. Maximal degree in co-relation 21315. Up to 3004 conditions per place. [2024-06-28 00:11:51,901 INFO L140 encePairwiseOnDemand]: 26/42 looper letters, 136 selfloop transitions, 75 changer transitions 0/214 dead transitions. [2024-06-28 00:11:51,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 214 transitions, 2604 flow [2024-06-28 00:11:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 00:11:51,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-28 00:11:51,911 INFO L175 Difference]: Start difference. First operand has 119 places, 159 transitions, 1852 flow. Second operand 8 states and 142 transitions. [2024-06-28 00:11:51,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 214 transitions, 2604 flow [2024-06-28 00:11:51,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 214 transitions, 2456 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-28 00:11:51,979 INFO L231 Difference]: Finished difference. Result has 122 places, 174 transitions, 2095 flow [2024-06-28 00:11:51,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1704, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2095, PETRI_PLACES=122, PETRI_TRANSITIONS=174} [2024-06-28 00:11:51,980 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2024-06-28 00:11:51,980 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 174 transitions, 2095 flow [2024-06-28 00:11:51,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:51,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:51,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:51,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:11:51,980 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:51,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash 726576071, now seen corresponding path program 2 times [2024-06-28 00:11:51,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:51,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096937520] [2024-06-28 00:11:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:51,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096937520] [2024-06-28 00:11:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096937520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:11:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428586118] [2024-06-28 00:11:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:57,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:11:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:11:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:11:57,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:11:57,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 174 transitions, 2095 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:57,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:57,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:11:57,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:59,192 INFO L124 PetriNetUnfolderBase]: 2354/3512 cut-off events. [2024-06-28 00:11:59,192 INFO L125 PetriNetUnfolderBase]: For 69687/69696 co-relation queries the response was YES. [2024-06-28 00:11:59,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22769 conditions, 3512 events. 2354/3512 cut-off events. For 69687/69696 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16342 event pairs, 627 based on Foata normal form. 14/3521 useless extension candidates. Maximal degree in co-relation 22710. Up to 3193 conditions per place. [2024-06-28 00:11:59,217 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 142 selfloop transitions, 60 changer transitions 0/205 dead transitions. [2024-06-28 00:11:59,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 205 transitions, 2706 flow [2024-06-28 00:11:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:11:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:11:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-28 00:11:59,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 00:11:59,220 INFO L175 Difference]: Start difference. First operand has 122 places, 174 transitions, 2095 flow. Second operand 7 states and 119 transitions. [2024-06-28 00:11:59,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 205 transitions, 2706 flow [2024-06-28 00:11:59,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 205 transitions, 2660 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 00:11:59,290 INFO L231 Difference]: Finished difference. Result has 125 places, 177 transitions, 2221 flow [2024-06-28 00:11:59,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2049, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2221, PETRI_PLACES=125, PETRI_TRANSITIONS=177} [2024-06-28 00:11:59,290 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-28 00:11:59,291 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 177 transitions, 2221 flow [2024-06-28 00:11:59,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:59,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:59,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:59,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:11:59,292 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:11:59,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1485702809, now seen corresponding path program 3 times [2024-06-28 00:11:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:59,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966670661] [2024-06-28 00:11:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:04,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966670661] [2024-06-28 00:12:04,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966670661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:04,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:04,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:12:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930712691] [2024-06-28 00:12:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:04,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:12:04,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:12:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:12:04,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:12:04,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 177 transitions, 2221 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:04,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:04,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:12:04,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:06,612 INFO L124 PetriNetUnfolderBase]: 2360/3520 cut-off events. [2024-06-28 00:12:06,613 INFO L125 PetriNetUnfolderBase]: For 73878/73887 co-relation queries the response was YES. [2024-06-28 00:12:06,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23245 conditions, 3520 events. 2360/3520 cut-off events. For 73878/73887 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16457 event pairs, 547 based on Foata normal form. 12/3527 useless extension candidates. Maximal degree in co-relation 23184. Up to 2911 conditions per place. [2024-06-28 00:12:06,649 INFO L140 encePairwiseOnDemand]: 26/42 looper letters, 130 selfloop transitions, 89 changer transitions 0/222 dead transitions. [2024-06-28 00:12:06,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 222 transitions, 2903 flow [2024-06-28 00:12:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-28 00:12:06,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-06-28 00:12:06,651 INFO L175 Difference]: Start difference. First operand has 125 places, 177 transitions, 2221 flow. Second operand 8 states and 146 transitions. [2024-06-28 00:12:06,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 222 transitions, 2903 flow [2024-06-28 00:12:06,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 222 transitions, 2751 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-28 00:12:06,742 INFO L231 Difference]: Finished difference. Result has 131 places, 185 transitions, 2396 flow [2024-06-28 00:12:06,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2396, PETRI_PLACES=131, PETRI_TRANSITIONS=185} [2024-06-28 00:12:06,743 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places. [2024-06-28 00:12:06,744 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 185 transitions, 2396 flow [2024-06-28 00:12:06,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:06,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:06,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:06,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:12:06,744 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:06,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1922685740, now seen corresponding path program 4 times [2024-06-28 00:12:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79334194] [2024-06-28 00:12:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:06,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79334194] [2024-06-28 00:12:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79334194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824667092] [2024-06-28 00:12:13,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:13,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:13,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:12:13,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 185 transitions, 2396 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:13,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:13,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:12:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:15,188 INFO L124 PetriNetUnfolderBase]: 2350/3507 cut-off events. [2024-06-28 00:12:15,189 INFO L125 PetriNetUnfolderBase]: For 88766/88775 co-relation queries the response was YES. [2024-06-28 00:12:15,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24809 conditions, 3507 events. 2350/3507 cut-off events. For 88766/88775 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16295 event pairs, 623 based on Foata normal form. 12/3514 useless extension candidates. Maximal degree in co-relation 24745. Up to 3197 conditions per place. [2024-06-28 00:12:15,212 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 151 selfloop transitions, 68 changer transitions 0/222 dead transitions. [2024-06-28 00:12:15,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 222 transitions, 3074 flow [2024-06-28 00:12:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 00:12:15,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-28 00:12:15,214 INFO L175 Difference]: Start difference. First operand has 131 places, 185 transitions, 2396 flow. Second operand 8 states and 135 transitions. [2024-06-28 00:12:15,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 222 transitions, 3074 flow [2024-06-28 00:12:15,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 222 transitions, 3007 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 00:12:15,292 INFO L231 Difference]: Finished difference. Result has 137 places, 190 transitions, 2571 flow [2024-06-28 00:12:15,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2329, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2571, PETRI_PLACES=137, PETRI_TRANSITIONS=190} [2024-06-28 00:12:15,293 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 94 predicate places. [2024-06-28 00:12:15,293 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 190 transitions, 2571 flow [2024-06-28 00:12:15,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:15,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:15,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:15,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:12:15,294 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:15,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1138026179, now seen corresponding path program 1 times [2024-06-28 00:12:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73400563] [2024-06-28 00:12:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73400563] [2024-06-28 00:12:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73400563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516002818] [2024-06-28 00:12:22,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:22,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:22,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:22,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:22,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:22,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:12:22,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 190 transitions, 2571 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:22,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:22,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:12:22,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:23,981 INFO L124 PetriNetUnfolderBase]: 2540/3816 cut-off events. [2024-06-28 00:12:23,981 INFO L125 PetriNetUnfolderBase]: For 105781/105789 co-relation queries the response was YES. [2024-06-28 00:12:23,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27706 conditions, 3816 events. 2540/3816 cut-off events. For 105781/105789 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18249 event pairs, 508 based on Foata normal form. 10/3821 useless extension candidates. Maximal degree in co-relation 27639. Up to 3167 conditions per place. [2024-06-28 00:12:24,013 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 172 selfloop transitions, 77 changer transitions 0/252 dead transitions. [2024-06-28 00:12:24,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 252 transitions, 3538 flow [2024-06-28 00:12:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-28 00:12:24,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2024-06-28 00:12:24,016 INFO L175 Difference]: Start difference. First operand has 137 places, 190 transitions, 2571 flow. Second operand 8 states and 163 transitions. [2024-06-28 00:12:24,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 252 transitions, 3538 flow [2024-06-28 00:12:24,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 252 transitions, 3401 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-28 00:12:24,137 INFO L231 Difference]: Finished difference. Result has 142 places, 198 transitions, 2753 flow [2024-06-28 00:12:24,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2434, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2753, PETRI_PLACES=142, PETRI_TRANSITIONS=198} [2024-06-28 00:12:24,137 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places. [2024-06-28 00:12:24,137 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 198 transitions, 2753 flow [2024-06-28 00:12:24,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:24,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:24,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:24,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:12:24,138 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:24,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:24,139 INFO L85 PathProgramCache]: Analyzing trace with hash -251550419, now seen corresponding path program 1 times [2024-06-28 00:12:24,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:24,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785013264] [2024-06-28 00:12:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785013264] [2024-06-28 00:12:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785013264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:31,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:31,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:31,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571965229] [2024-06-28 00:12:31,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:31,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:31,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:31,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:31,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:31,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:12:31,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 198 transitions, 2753 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:31,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:31,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:12:31,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:33,664 INFO L124 PetriNetUnfolderBase]: 2602/3909 cut-off events. [2024-06-28 00:12:33,664 INFO L125 PetriNetUnfolderBase]: For 119786/119819 co-relation queries the response was YES. [2024-06-28 00:12:33,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29418 conditions, 3909 events. 2602/3909 cut-off events. For 119786/119819 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18868 event pairs, 649 based on Foata normal form. 28/3922 useless extension candidates. Maximal degree in co-relation 29348. Up to 3437 conditions per place. [2024-06-28 00:12:33,699 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 175 selfloop transitions, 67 changer transitions 0/245 dead transitions. [2024-06-28 00:12:33,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 245 transitions, 3554 flow [2024-06-28 00:12:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 00:12:33,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-28 00:12:33,701 INFO L175 Difference]: Start difference. First operand has 142 places, 198 transitions, 2753 flow. Second operand 8 states and 142 transitions. [2024-06-28 00:12:33,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 245 transitions, 3554 flow [2024-06-28 00:12:33,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 245 transitions, 3420 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-28 00:12:33,831 INFO L231 Difference]: Finished difference. Result has 147 places, 204 transitions, 2851 flow [2024-06-28 00:12:33,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2619, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2851, PETRI_PLACES=147, PETRI_TRANSITIONS=204} [2024-06-28 00:12:33,832 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places. [2024-06-28 00:12:33,832 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 204 transitions, 2851 flow [2024-06-28 00:12:33,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:33,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:33,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:33,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:12:33,833 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:33,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1300763841, now seen corresponding path program 2 times [2024-06-28 00:12:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668523163] [2024-06-28 00:12:33,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668523163] [2024-06-28 00:12:40,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668523163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:40,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034022024] [2024-06-28 00:12:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:40,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:40,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:40,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:40,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:12:40,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 204 transitions, 2851 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:40,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:40,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:12:40,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:42,215 INFO L124 PetriNetUnfolderBase]: 2622/3938 cut-off events. [2024-06-28 00:12:42,215 INFO L125 PetriNetUnfolderBase]: For 126521/126529 co-relation queries the response was YES. [2024-06-28 00:12:42,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30189 conditions, 3938 events. 2622/3938 cut-off events. For 126521/126529 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19024 event pairs, 623 based on Foata normal form. 10/3943 useless extension candidates. Maximal degree in co-relation 30117. Up to 3577 conditions per place. [2024-06-28 00:12:42,245 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 181 selfloop transitions, 68 changer transitions 0/252 dead transitions. [2024-06-28 00:12:42,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 252 transitions, 3514 flow [2024-06-28 00:12:42,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-28 00:12:42,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-28 00:12:42,248 INFO L175 Difference]: Start difference. First operand has 147 places, 204 transitions, 2851 flow. Second operand 8 states and 152 transitions. [2024-06-28 00:12:42,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 252 transitions, 3514 flow [2024-06-28 00:12:42,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 252 transitions, 3444 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-28 00:12:42,379 INFO L231 Difference]: Finished difference. Result has 152 places, 206 transitions, 2960 flow [2024-06-28 00:12:42,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2781, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2960, PETRI_PLACES=152, PETRI_TRANSITIONS=206} [2024-06-28 00:12:42,380 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2024-06-28 00:12:42,380 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 206 transitions, 2960 flow [2024-06-28 00:12:42,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:42,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:42,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:42,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 00:12:42,381 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:42,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:42,382 INFO L85 PathProgramCache]: Analyzing trace with hash -467953811, now seen corresponding path program 2 times [2024-06-28 00:12:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:42,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905700140] [2024-06-28 00:12:42,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905700140] [2024-06-28 00:12:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905700140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723576194] [2024-06-28 00:12:52,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:52,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:52,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:52,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:12:52,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 206 transitions, 2960 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:52,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:52,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:12:52,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:53,814 INFO L124 PetriNetUnfolderBase]: 2666/4005 cut-off events. [2024-06-28 00:12:53,814 INFO L125 PetriNetUnfolderBase]: For 137928/137961 co-relation queries the response was YES. [2024-06-28 00:12:53,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31235 conditions, 4005 events. 2666/4005 cut-off events. For 137928/137961 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19438 event pairs, 627 based on Foata normal form. 28/4018 useless extension candidates. Maximal degree in co-relation 31161. Up to 3554 conditions per place. [2024-06-28 00:12:53,852 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 180 selfloop transitions, 67 changer transitions 0/250 dead transitions. [2024-06-28 00:12:53,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 250 transitions, 3789 flow [2024-06-28 00:12:53,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-28 00:12:53,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-28 00:12:53,855 INFO L175 Difference]: Start difference. First operand has 152 places, 206 transitions, 2960 flow. Second operand 8 states and 140 transitions. [2024-06-28 00:12:53,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 250 transitions, 3789 flow [2024-06-28 00:12:54,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 250 transitions, 3634 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 00:12:54,023 INFO L231 Difference]: Finished difference. Result has 154 places, 212 transitions, 3049 flow [2024-06-28 00:12:54,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2805, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3049, PETRI_PLACES=154, PETRI_TRANSITIONS=212} [2024-06-28 00:12:54,024 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places. [2024-06-28 00:12:54,024 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 212 transitions, 3049 flow [2024-06-28 00:12:54,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:54,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:54,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:54,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 00:12:54,025 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:12:54,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1297967331, now seen corresponding path program 3 times [2024-06-28 00:12:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011869357] [2024-06-28 00:12:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:04,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:04,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011869357] [2024-06-28 00:13:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011869357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:04,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:04,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:04,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792792802] [2024-06-28 00:13:04,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:04,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:04,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:04,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:04,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:13:04,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 212 transitions, 3049 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:04,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:04,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:13:04,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:06,833 INFO L124 PetriNetUnfolderBase]: 2658/3989 cut-off events. [2024-06-28 00:13:06,834 INFO L125 PetriNetUnfolderBase]: For 143957/143965 co-relation queries the response was YES. [2024-06-28 00:13:06,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31598 conditions, 3989 events. 2658/3989 cut-off events. For 143957/143965 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19285 event pairs, 629 based on Foata normal form. 10/3994 useless extension candidates. Maximal degree in co-relation 31523. Up to 3669 conditions per place. [2024-06-28 00:13:06,869 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 190 selfloop transitions, 63 changer transitions 0/256 dead transitions. [2024-06-28 00:13:06,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 256 transitions, 3720 flow [2024-06-28 00:13:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-28 00:13:06,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-28 00:13:06,872 INFO L175 Difference]: Start difference. First operand has 154 places, 212 transitions, 3049 flow. Second operand 9 states and 153 transitions. [2024-06-28 00:13:06,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 256 transitions, 3720 flow [2024-06-28 00:13:07,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 256 transitions, 3587 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-28 00:13:07,048 INFO L231 Difference]: Finished difference. Result has 159 places, 214 transitions, 3097 flow [2024-06-28 00:13:07,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2916, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3097, PETRI_PLACES=159, PETRI_TRANSITIONS=214} [2024-06-28 00:13:07,049 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places. [2024-06-28 00:13:07,049 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 214 transitions, 3097 flow [2024-06-28 00:13:07,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:07,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:07,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:07,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 00:13:07,049 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:07,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash 933733507, now seen corresponding path program 3 times [2024-06-28 00:13:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:07,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017391745] [2024-06-28 00:13:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:07,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:15,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017391745] [2024-06-28 00:13:15,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017391745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:15,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:15,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846022343] [2024-06-28 00:13:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:15,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:15,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:13:15,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 214 transitions, 3097 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:15,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:15,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:13:15,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:16,973 INFO L124 PetriNetUnfolderBase]: 2648/3979 cut-off events. [2024-06-28 00:13:16,973 INFO L125 PetriNetUnfolderBase]: For 152124/152157 co-relation queries the response was YES. [2024-06-28 00:13:16,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31855 conditions, 3979 events. 2648/3979 cut-off events. For 152124/152157 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19301 event pairs, 625 based on Foata normal form. 28/3992 useless extension candidates. Maximal degree in co-relation 31778. Up to 3567 conditions per place. [2024-06-28 00:13:17,010 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 184 selfloop transitions, 62 changer transitions 0/249 dead transitions. [2024-06-28 00:13:17,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 249 transitions, 3706 flow [2024-06-28 00:13:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:13:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:13:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 00:13:17,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-28 00:13:17,012 INFO L175 Difference]: Start difference. First operand has 159 places, 214 transitions, 3097 flow. Second operand 8 states and 135 transitions. [2024-06-28 00:13:17,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 249 transitions, 3706 flow [2024-06-28 00:13:17,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 249 transitions, 3533 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-28 00:13:17,192 INFO L231 Difference]: Finished difference. Result has 160 places, 214 transitions, 3056 flow [2024-06-28 00:13:17,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2924, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3056, PETRI_PLACES=160, PETRI_TRANSITIONS=214} [2024-06-28 00:13:17,193 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-28 00:13:17,193 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 214 transitions, 3056 flow [2024-06-28 00:13:17,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:17,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:17,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:17,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 00:13:17,193 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:17,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash 86615455, now seen corresponding path program 1 times [2024-06-28 00:13:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:17,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528717419] [2024-06-28 00:13:17,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:17,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:23,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528717419] [2024-06-28 00:13:23,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528717419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:23,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:23,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:13:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902535019] [2024-06-28 00:13:23,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:23,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:13:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:23,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:13:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:13:23,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:13:23,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 214 transitions, 3056 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:23,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:23,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:13:23,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:25,913 INFO L124 PetriNetUnfolderBase]: 2643/3966 cut-off events. [2024-06-28 00:13:25,913 INFO L125 PetriNetUnfolderBase]: For 155029/155038 co-relation queries the response was YES. [2024-06-28 00:13:25,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31868 conditions, 3966 events. 2643/3966 cut-off events. For 155029/155038 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19121 event pairs, 609 based on Foata normal form. 10/3971 useless extension candidates. Maximal degree in co-relation 31790. Up to 3718 conditions per place. [2024-06-28 00:13:25,951 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 180 selfloop transitions, 57 changer transitions 0/240 dead transitions. [2024-06-28 00:13:25,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 240 transitions, 3645 flow [2024-06-28 00:13:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:13:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:13:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-28 00:13:25,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2024-06-28 00:13:25,954 INFO L175 Difference]: Start difference. First operand has 160 places, 214 transitions, 3056 flow. Second operand 7 states and 118 transitions. [2024-06-28 00:13:25,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 240 transitions, 3645 flow [2024-06-28 00:13:26,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 240 transitions, 3513 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-28 00:13:26,105 INFO L231 Difference]: Finished difference. Result has 160 places, 217 transitions, 3109 flow [2024-06-28 00:13:26,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2924, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3109, PETRI_PLACES=160, PETRI_TRANSITIONS=217} [2024-06-28 00:13:26,108 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-28 00:13:26,108 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 217 transitions, 3109 flow [2024-06-28 00:13:26,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:26,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:26,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:26,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 00:13:26,109 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:26,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash -800500393, now seen corresponding path program 4 times [2024-06-28 00:13:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228566528] [2024-06-28 00:13:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:33,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228566528] [2024-06-28 00:13:33,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228566528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:33,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:33,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304675456] [2024-06-28 00:13:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:33,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:33,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:33,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:13:33,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 217 transitions, 3109 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:33,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:33,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:13:33,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:35,420 INFO L124 PetriNetUnfolderBase]: 2682/4023 cut-off events. [2024-06-28 00:13:35,420 INFO L125 PetriNetUnfolderBase]: For 166421/166430 co-relation queries the response was YES. [2024-06-28 00:13:35,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32612 conditions, 4023 events. 2682/4023 cut-off events. For 166421/166430 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19418 event pairs, 609 based on Foata normal form. 14/4032 useless extension candidates. Maximal degree in co-relation 32533. Up to 3799 conditions per place. [2024-06-28 00:13:35,451 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 198 selfloop transitions, 52 changer transitions 0/253 dead transitions. [2024-06-28 00:13:35,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 253 transitions, 3802 flow [2024-06-28 00:13:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-06-28 00:13:35,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36243386243386244 [2024-06-28 00:13:35,455 INFO L175 Difference]: Start difference. First operand has 160 places, 217 transitions, 3109 flow. Second operand 9 states and 137 transitions. [2024-06-28 00:13:35,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 253 transitions, 3802 flow [2024-06-28 00:13:35,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 253 transitions, 3682 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 00:13:35,623 INFO L231 Difference]: Finished difference. Result has 163 places, 223 transitions, 3215 flow [2024-06-28 00:13:35,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2989, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3215, PETRI_PLACES=163, PETRI_TRANSITIONS=223} [2024-06-28 00:13:35,624 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2024-06-28 00:13:35,624 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 223 transitions, 3215 flow [2024-06-28 00:13:35,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:35,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:35,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:35,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 00:13:35,624 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:35,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:35,625 INFO L85 PathProgramCache]: Analyzing trace with hash -806025187, now seen corresponding path program 5 times [2024-06-28 00:13:35,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:35,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024369490] [2024-06-28 00:13:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:42,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024369490] [2024-06-28 00:13:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024369490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449377798] [2024-06-28 00:13:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:42,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:42,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:42,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:13:42,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 223 transitions, 3215 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:42,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:42,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:13:42,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:44,707 INFO L124 PetriNetUnfolderBase]: 2703/4053 cut-off events. [2024-06-28 00:13:44,708 INFO L125 PetriNetUnfolderBase]: For 158084/158093 co-relation queries the response was YES. [2024-06-28 00:13:44,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32895 conditions, 4053 events. 2703/4053 cut-off events. For 158084/158093 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 19598 event pairs, 607 based on Foata normal form. 10/4058 useless extension candidates. Maximal degree in co-relation 32817. Up to 3696 conditions per place. [2024-06-28 00:13:44,749 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 187 selfloop transitions, 73 changer transitions 0/263 dead transitions. [2024-06-28 00:13:44,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 263 transitions, 3972 flow [2024-06-28 00:13:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:13:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:13:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 00:13:44,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-28 00:13:44,752 INFO L175 Difference]: Start difference. First operand has 163 places, 223 transitions, 3215 flow. Second operand 8 states and 135 transitions. [2024-06-28 00:13:44,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 263 transitions, 3972 flow [2024-06-28 00:13:44,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 263 transitions, 3826 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-28 00:13:44,952 INFO L231 Difference]: Finished difference. Result has 166 places, 229 transitions, 3361 flow [2024-06-28 00:13:44,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3069, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3361, PETRI_PLACES=166, PETRI_TRANSITIONS=229} [2024-06-28 00:13:44,953 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places. [2024-06-28 00:13:44,953 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 229 transitions, 3361 flow [2024-06-28 00:13:44,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:44,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:44,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:44,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 00:13:44,969 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:44,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash -806029961, now seen corresponding path program 4 times [2024-06-28 00:13:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022364495] [2024-06-28 00:13:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:44,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:52,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022364495] [2024-06-28 00:13:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022364495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399938013] [2024-06-28 00:13:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:52,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:52,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:52,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:52,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:13:52,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 229 transitions, 3361 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:52,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:52,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:13:52,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:54,754 INFO L124 PetriNetUnfolderBase]: 2736/4102 cut-off events. [2024-06-28 00:13:54,755 INFO L125 PetriNetUnfolderBase]: For 168956/168956 co-relation queries the response was YES. [2024-06-28 00:13:54,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34024 conditions, 4102 events. 2736/4102 cut-off events. For 168956/168956 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19835 event pairs, 607 based on Foata normal form. 4/4103 useless extension candidates. Maximal degree in co-relation 33944. Up to 3972 conditions per place. [2024-06-28 00:13:54,794 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 229 selfloop transitions, 37 changer transitions 0/269 dead transitions. [2024-06-28 00:13:54,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 269 transitions, 4066 flow [2024-06-28 00:13:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:13:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:13:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2024-06-28 00:13:54,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-28 00:13:54,797 INFO L175 Difference]: Start difference. First operand has 166 places, 229 transitions, 3361 flow. Second operand 10 states and 148 transitions. [2024-06-28 00:13:54,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 269 transitions, 4066 flow [2024-06-28 00:13:54,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 269 transitions, 3958 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-28 00:13:54,993 INFO L231 Difference]: Finished difference. Result has 173 places, 234 transitions, 3423 flow [2024-06-28 00:13:54,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3253, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3423, PETRI_PLACES=173, PETRI_TRANSITIONS=234} [2024-06-28 00:13:54,993 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-28 00:13:54,994 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 234 transitions, 3423 flow [2024-06-28 00:13:54,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:54,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:54,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:54,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 00:13:54,994 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:13:54,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1049020027, now seen corresponding path program 6 times [2024-06-28 00:13:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073806336] [2024-06-28 00:13:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:01,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:01,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073806336] [2024-06-28 00:14:01,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073806336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:01,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:01,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659019196] [2024-06-28 00:14:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:01,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:14:01,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 234 transitions, 3423 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:01,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:01,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:14:01,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:03,444 INFO L124 PetriNetUnfolderBase]: 2731/4096 cut-off events. [2024-06-28 00:14:03,444 INFO L125 PetriNetUnfolderBase]: For 175611/175620 co-relation queries the response was YES. [2024-06-28 00:14:03,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34258 conditions, 4096 events. 2731/4096 cut-off events. For 175611/175620 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 19926 event pairs, 528 based on Foata normal form. 10/4101 useless extension candidates. Maximal degree in co-relation 34175. Up to 3332 conditions per place. [2024-06-28 00:14:03,483 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 156 selfloop transitions, 118 changer transitions 0/277 dead transitions. [2024-06-28 00:14:03,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 277 transitions, 4282 flow [2024-06-28 00:14:03,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:14:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:14:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-28 00:14:03,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-28 00:14:03,485 INFO L175 Difference]: Start difference. First operand has 173 places, 234 transitions, 3423 flow. Second operand 8 states and 142 transitions. [2024-06-28 00:14:03,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 277 transitions, 4282 flow [2024-06-28 00:14:03,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 277 transitions, 4153 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-28 00:14:03,652 INFO L231 Difference]: Finished difference. Result has 173 places, 240 transitions, 3651 flow [2024-06-28 00:14:03,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3651, PETRI_PLACES=173, PETRI_TRANSITIONS=240} [2024-06-28 00:14:03,652 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-28 00:14:03,653 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 240 transitions, 3651 flow [2024-06-28 00:14:03,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:03,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:03,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:03,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 00:14:03,653 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:03,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1146321327, now seen corresponding path program 1 times [2024-06-28 00:14:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910623980] [2024-06-28 00:14:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:03,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910623980] [2024-06-28 00:14:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910623980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543035078] [2024-06-28 00:14:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:12,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:12,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:12,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:12,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:14:12,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 240 transitions, 3651 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:12,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:12,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:14:12,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:15,146 INFO L124 PetriNetUnfolderBase]: 2751/4129 cut-off events. [2024-06-28 00:14:15,146 INFO L125 PetriNetUnfolderBase]: For 189129/189138 co-relation queries the response was YES. [2024-06-28 00:14:15,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35589 conditions, 4129 events. 2751/4129 cut-off events. For 189129/189138 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 20068 event pairs, 617 based on Foata normal form. 12/4136 useless extension candidates. Maximal degree in co-relation 35505. Up to 3888 conditions per place. [2024-06-28 00:14:15,181 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 216 selfloop transitions, 47 changer transitions 0/266 dead transitions. [2024-06-28 00:14:15,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 266 transitions, 4293 flow [2024-06-28 00:14:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:14:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:14:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 00:14:15,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2024-06-28 00:14:15,184 INFO L175 Difference]: Start difference. First operand has 173 places, 240 transitions, 3651 flow. Second operand 7 states and 117 transitions. [2024-06-28 00:14:15,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 266 transitions, 4293 flow [2024-06-28 00:14:15,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 266 transitions, 4076 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-28 00:14:15,383 INFO L231 Difference]: Finished difference. Result has 175 places, 242 transitions, 3587 flow [2024-06-28 00:14:15,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3436, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3587, PETRI_PLACES=175, PETRI_TRANSITIONS=242} [2024-06-28 00:14:15,384 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 132 predicate places. [2024-06-28 00:14:15,384 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 242 transitions, 3587 flow [2024-06-28 00:14:15,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:15,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:15,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:15,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 00:14:15,385 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:15,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash -289624489, now seen corresponding path program 2 times [2024-06-28 00:14:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:15,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407920796] [2024-06-28 00:14:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407920796] [2024-06-28 00:14:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407920796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:25,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:25,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:14:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455097950] [2024-06-28 00:14:25,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:25,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:14:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:14:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:14:25,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:14:25,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 242 transitions, 3587 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:25,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:25,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:14:25,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:26,938 INFO L124 PetriNetUnfolderBase]: 2743/4117 cut-off events. [2024-06-28 00:14:26,939 INFO L125 PetriNetUnfolderBase]: For 193758/193767 co-relation queries the response was YES. [2024-06-28 00:14:26,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34896 conditions, 4117 events. 2743/4117 cut-off events. For 193758/193767 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 20001 event pairs, 556 based on Foata normal form. 12/4124 useless extension candidates. Maximal degree in co-relation 34812. Up to 3804 conditions per place. [2024-06-28 00:14:26,975 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 219 selfloop transitions, 47 changer transitions 0/269 dead transitions. [2024-06-28 00:14:26,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 269 transitions, 4236 flow [2024-06-28 00:14:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:14:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:14:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2024-06-28 00:14:26,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3630952380952381 [2024-06-28 00:14:26,982 INFO L175 Difference]: Start difference. First operand has 175 places, 242 transitions, 3587 flow. Second operand 8 states and 122 transitions. [2024-06-28 00:14:26,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 269 transitions, 4236 flow [2024-06-28 00:14:27,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 269 transitions, 4088 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-28 00:14:27,183 INFO L231 Difference]: Finished difference. Result has 177 places, 244 transitions, 3593 flow [2024-06-28 00:14:27,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3439, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3593, PETRI_PLACES=177, PETRI_TRANSITIONS=244} [2024-06-28 00:14:27,184 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-28 00:14:27,184 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 244 transitions, 3593 flow [2024-06-28 00:14:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:27,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:27,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:27,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 00:14:27,184 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:27,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash -526281217, now seen corresponding path program 5 times [2024-06-28 00:14:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:27,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333325963] [2024-06-28 00:14:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:34,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333325963] [2024-06-28 00:14:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333325963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:34,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:34,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:14:34,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871636487] [2024-06-28 00:14:34,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:34,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:14:34,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:14:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:14:34,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:14:34,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 244 transitions, 3593 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:34,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:34,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:14:34,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:36,598 INFO L124 PetriNetUnfolderBase]: 2831/4265 cut-off events. [2024-06-28 00:14:36,598 INFO L125 PetriNetUnfolderBase]: For 216483/216492 co-relation queries the response was YES. [2024-06-28 00:14:36,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35933 conditions, 4265 events. 2831/4265 cut-off events. For 216483/216492 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20975 event pairs, 631 based on Foata normal form. 36/4296 useless extension candidates. Maximal degree in co-relation 35848. Up to 3781 conditions per place. [2024-06-28 00:14:36,634 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 220 selfloop transitions, 64 changer transitions 0/287 dead transitions. [2024-06-28 00:14:36,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 287 transitions, 4432 flow [2024-06-28 00:14:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 00:14:36,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41005291005291006 [2024-06-28 00:14:36,637 INFO L175 Difference]: Start difference. First operand has 177 places, 244 transitions, 3593 flow. Second operand 9 states and 155 transitions. [2024-06-28 00:14:36,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 287 transitions, 4432 flow [2024-06-28 00:14:36,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 287 transitions, 4299 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-28 00:14:36,844 INFO L231 Difference]: Finished difference. Result has 181 places, 250 transitions, 3765 flow [2024-06-28 00:14:36,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3460, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3765, PETRI_PLACES=181, PETRI_TRANSITIONS=250} [2024-06-28 00:14:36,844 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places. [2024-06-28 00:14:36,844 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 250 transitions, 3765 flow [2024-06-28 00:14:36,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:36,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:36,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:36,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 00:14:36,845 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:36,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1622765091, now seen corresponding path program 6 times [2024-06-28 00:14:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163202202] [2024-06-28 00:14:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:43,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:43,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163202202] [2024-06-28 00:14:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163202202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:43,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:43,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:14:43,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093858977] [2024-06-28 00:14:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:43,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:14:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:43,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:14:43,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:14:43,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:14:43,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 250 transitions, 3765 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:43,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:43,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:14:43,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:45,252 INFO L124 PetriNetUnfolderBase]: 2823/4251 cut-off events. [2024-06-28 00:14:45,253 INFO L125 PetriNetUnfolderBase]: For 220576/220576 co-relation queries the response was YES. [2024-06-28 00:14:45,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36708 conditions, 4251 events. 2823/4251 cut-off events. For 220576/220576 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20877 event pairs, 622 based on Foata normal form. 4/4253 useless extension candidates. Maximal degree in co-relation 36621. Up to 4066 conditions per place. [2024-06-28 00:14:45,298 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 239 selfloop transitions, 47 changer transitions 0/289 dead transitions. [2024-06-28 00:14:45,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 289 transitions, 4473 flow [2024-06-28 00:14:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-28 00:14:45,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.373015873015873 [2024-06-28 00:14:45,303 INFO L175 Difference]: Start difference. First operand has 181 places, 250 transitions, 3765 flow. Second operand 9 states and 141 transitions. [2024-06-28 00:14:45,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 289 transitions, 4473 flow [2024-06-28 00:14:45,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 289 transitions, 4340 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-28 00:14:45,626 INFO L231 Difference]: Finished difference. Result has 186 places, 251 transitions, 3765 flow [2024-06-28 00:14:45,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3632, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3765, PETRI_PLACES=186, PETRI_TRANSITIONS=251} [2024-06-28 00:14:45,627 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places. [2024-06-28 00:14:45,627 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 251 transitions, 3765 flow [2024-06-28 00:14:45,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:45,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:45,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:45,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 00:14:45,628 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:45,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1207742998, now seen corresponding path program 1 times [2024-06-28 00:14:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:45,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360346769] [2024-06-28 00:14:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:14:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:14:53,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:14:53,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360346769] [2024-06-28 00:14:53,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360346769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:14:53,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:14:53,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:14:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315346858] [2024-06-28 00:14:53,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:14:53,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:14:53,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:14:53,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:14:53,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:14:53,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:14:53,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 251 transitions, 3765 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:53,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:14:53,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:14:53,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:14:55,775 INFO L124 PetriNetUnfolderBase]: 3101/4721 cut-off events. [2024-06-28 00:14:55,775 INFO L125 PetriNetUnfolderBase]: For 267069/267102 co-relation queries the response was YES. [2024-06-28 00:14:55,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40572 conditions, 4721 events. 3101/4721 cut-off events. For 267069/267102 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 24407 event pairs, 589 based on Foata normal form. 40/4746 useless extension candidates. Maximal degree in co-relation 40483. Up to 3263 conditions per place. [2024-06-28 00:14:55,812 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 209 selfloop transitions, 102 changer transitions 0/314 dead transitions. [2024-06-28 00:14:55,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 314 transitions, 5089 flow [2024-06-28 00:14:55,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:14:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:14:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-28 00:14:55,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-06-28 00:14:55,815 INFO L175 Difference]: Start difference. First operand has 186 places, 251 transitions, 3765 flow. Second operand 9 states and 165 transitions. [2024-06-28 00:14:55,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 314 transitions, 5089 flow [2024-06-28 00:14:56,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 314 transitions, 4957 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-28 00:14:56,089 INFO L231 Difference]: Finished difference. Result has 190 places, 257 transitions, 4105 flow [2024-06-28 00:14:56,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3641, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4105, PETRI_PLACES=190, PETRI_TRANSITIONS=257} [2024-06-28 00:14:56,090 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places. [2024-06-28 00:14:56,090 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 257 transitions, 4105 flow [2024-06-28 00:14:56,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:14:56,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:14:56,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:14:56,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 00:14:56,091 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:14:56,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:14:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1668966576, now seen corresponding path program 2 times [2024-06-28 00:14:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:14:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359541403] [2024-06-28 00:14:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:14:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:14:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:04,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:04,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359541403] [2024-06-28 00:15:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359541403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:04,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:04,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:15:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621959936] [2024-06-28 00:15:04,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:04,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:15:04,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:04,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:15:04,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:15:04,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:15:04,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 257 transitions, 4105 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:04,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:04,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:15:04,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:06,519 INFO L124 PetriNetUnfolderBase]: 3189/4869 cut-off events. [2024-06-28 00:15:06,519 INFO L125 PetriNetUnfolderBase]: For 276797/276830 co-relation queries the response was YES. [2024-06-28 00:15:06,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42540 conditions, 4869 events. 3189/4869 cut-off events. For 276797/276830 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 25447 event pairs, 749 based on Foata normal form. 44/4898 useless extension candidates. Maximal degree in co-relation 42448. Up to 4143 conditions per place. [2024-06-28 00:15:06,565 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 213 selfloop transitions, 92 changer transitions 0/308 dead transitions. [2024-06-28 00:15:06,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 308 transitions, 5101 flow [2024-06-28 00:15:06,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:15:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:15:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 00:15:06,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-28 00:15:06,568 INFO L175 Difference]: Start difference. First operand has 190 places, 257 transitions, 4105 flow. Second operand 8 states and 154 transitions. [2024-06-28 00:15:06,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 308 transitions, 5101 flow [2024-06-28 00:15:06,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 308 transitions, 4993 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-28 00:15:06,900 INFO L231 Difference]: Finished difference. Result has 194 places, 258 transitions, 4229 flow [2024-06-28 00:15:06,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3999, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4229, PETRI_PLACES=194, PETRI_TRANSITIONS=258} [2024-06-28 00:15:06,901 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places. [2024-06-28 00:15:06,901 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 258 transitions, 4229 flow [2024-06-28 00:15:06,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:06,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:06,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:06,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 00:15:06,902 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:06,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:06,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1668970296, now seen corresponding path program 3 times [2024-06-28 00:15:06,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:06,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908089048] [2024-06-28 00:15:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908089048] [2024-06-28 00:15:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908089048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842422981] [2024-06-28 00:15:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:14,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:14,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:15:14,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 258 transitions, 4229 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:14,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:14,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:15:14,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:16,685 INFO L124 PetriNetUnfolderBase]: 3257/4985 cut-off events. [2024-06-28 00:15:16,686 INFO L125 PetriNetUnfolderBase]: For 288612/288645 co-relation queries the response was YES. [2024-06-28 00:15:16,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43727 conditions, 4985 events. 3257/4985 cut-off events. For 288612/288645 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 26298 event pairs, 747 based on Foata normal form. 40/5010 useless extension candidates. Maximal degree in co-relation 43634. Up to 4201 conditions per place. [2024-06-28 00:15:16,729 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 229 selfloop transitions, 81 changer transitions 0/313 dead transitions. [2024-06-28 00:15:16,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 313 transitions, 5275 flow [2024-06-28 00:15:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-28 00:15:16,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2024-06-28 00:15:16,731 INFO L175 Difference]: Start difference. First operand has 194 places, 258 transitions, 4229 flow. Second operand 9 states and 163 transitions. [2024-06-28 00:15:16,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 313 transitions, 5275 flow [2024-06-28 00:15:17,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 313 transitions, 5070 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 00:15:17,083 INFO L231 Difference]: Finished difference. Result has 197 places, 259 transitions, 4233 flow [2024-06-28 00:15:17,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4024, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4233, PETRI_PLACES=197, PETRI_TRANSITIONS=259} [2024-06-28 00:15:17,093 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places. [2024-06-28 00:15:17,094 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 259 transitions, 4233 flow [2024-06-28 00:15:17,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:17,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:17,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:17,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 00:15:17,094 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:17,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:17,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1582274766, now seen corresponding path program 4 times [2024-06-28 00:15:17,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:17,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031758916] [2024-06-28 00:15:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:29,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031758916] [2024-06-28 00:15:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031758916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835916873] [2024-06-28 00:15:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:29,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:29,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:29,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:29,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:29,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:15:29,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 259 transitions, 4233 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:29,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:29,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:15:29,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:31,607 INFO L124 PetriNetUnfolderBase]: 3345/5133 cut-off events. [2024-06-28 00:15:31,607 INFO L125 PetriNetUnfolderBase]: For 305964/305997 co-relation queries the response was YES. [2024-06-28 00:15:31,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44832 conditions, 5133 events. 3345/5133 cut-off events. For 305964/305997 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 27410 event pairs, 767 based on Foata normal form. 44/5162 useless extension candidates. Maximal degree in co-relation 44737. Up to 4542 conditions per place. [2024-06-28 00:15:31,658 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 235 selfloop transitions, 68 changer transitions 0/306 dead transitions. [2024-06-28 00:15:31,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 306 transitions, 5080 flow [2024-06-28 00:15:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-28 00:15:31,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41005291005291006 [2024-06-28 00:15:31,661 INFO L175 Difference]: Start difference. First operand has 197 places, 259 transitions, 4233 flow. Second operand 9 states and 155 transitions. [2024-06-28 00:15:31,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 306 transitions, 5080 flow [2024-06-28 00:15:31,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 306 transitions, 4928 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 00:15:31,991 INFO L231 Difference]: Finished difference. Result has 200 places, 260 transitions, 4264 flow [2024-06-28 00:15:31,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4081, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4264, PETRI_PLACES=200, PETRI_TRANSITIONS=260} [2024-06-28 00:15:31,991 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places. [2024-06-28 00:15:31,991 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 260 transitions, 4264 flow [2024-06-28 00:15:31,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:31,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:31,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:31,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 00:15:31,992 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:31,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1582278486, now seen corresponding path program 5 times [2024-06-28 00:15:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:31,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135581460] [2024-06-28 00:15:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135581460] [2024-06-28 00:15:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135581460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:41,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55836505] [2024-06-28 00:15:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:41,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:41,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:41,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:41,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:41,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:15:41,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 260 transitions, 4264 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:41,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:41,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:15:41,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:44,152 INFO L124 PetriNetUnfolderBase]: 3509/5409 cut-off events. [2024-06-28 00:15:44,153 INFO L125 PetriNetUnfolderBase]: For 332914/332947 co-relation queries the response was YES. [2024-06-28 00:15:44,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47455 conditions, 5409 events. 3509/5409 cut-off events. For 332914/332947 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 29436 event pairs, 791 based on Foata normal form. 40/5434 useless extension candidates. Maximal degree in co-relation 47359. Up to 4492 conditions per place. [2024-06-28 00:15:44,204 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 239 selfloop transitions, 71 changer transitions 0/313 dead transitions. [2024-06-28 00:15:44,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 313 transitions, 5359 flow [2024-06-28 00:15:44,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:15:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:15:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-28 00:15:44,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-28 00:15:44,206 INFO L175 Difference]: Start difference. First operand has 200 places, 260 transitions, 4264 flow. Second operand 9 states and 159 transitions. [2024-06-28 00:15:44,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 313 transitions, 5359 flow [2024-06-28 00:15:44,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 313 transitions, 5206 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-28 00:15:44,548 INFO L231 Difference]: Finished difference. Result has 202 places, 262 transitions, 4341 flow [2024-06-28 00:15:44,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4111, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4341, PETRI_PLACES=202, PETRI_TRANSITIONS=262} [2024-06-28 00:15:44,549 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places. [2024-06-28 00:15:44,549 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 262 transitions, 4341 flow [2024-06-28 00:15:44,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:44,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:44,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:44,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 00:15:44,550 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:44,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1669879178, now seen corresponding path program 1 times [2024-06-28 00:15:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:44,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783110238] [2024-06-28 00:15:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:44,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:15:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:15:56,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:15:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783110238] [2024-06-28 00:15:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783110238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:15:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:15:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:15:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37000233] [2024-06-28 00:15:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:15:56,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:15:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:15:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:15:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:15:56,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:15:56,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 262 transitions, 4341 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:56,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:15:56,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:15:56,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:15:58,682 INFO L124 PetriNetUnfolderBase]: 3529/5441 cut-off events. [2024-06-28 00:15:58,682 INFO L125 PetriNetUnfolderBase]: For 336259/336292 co-relation queries the response was YES. [2024-06-28 00:15:58,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47921 conditions, 5441 events. 3529/5441 cut-off events. For 336259/336292 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 29718 event pairs, 813 based on Foata normal form. 28/5454 useless extension candidates. Maximal degree in co-relation 47824. Up to 5035 conditions per place. [2024-06-28 00:15:58,729 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 235 selfloop transitions, 61 changer transitions 0/299 dead transitions. [2024-06-28 00:15:58,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 299 transitions, 5102 flow [2024-06-28 00:15:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:15:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:15:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 00:15:58,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2024-06-28 00:15:58,732 INFO L175 Difference]: Start difference. First operand has 202 places, 262 transitions, 4341 flow. Second operand 8 states and 134 transitions. [2024-06-28 00:15:58,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 299 transitions, 5102 flow [2024-06-28 00:15:59,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 299 transitions, 4985 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 00:15:59,063 INFO L231 Difference]: Finished difference. Result has 205 places, 264 transitions, 4415 flow [2024-06-28 00:15:59,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4224, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4415, PETRI_PLACES=205, PETRI_TRANSITIONS=264} [2024-06-28 00:15:59,064 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places. [2024-06-28 00:15:59,065 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 264 transitions, 4415 flow [2024-06-28 00:15:59,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:15:59,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:15:59,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:15:59,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 00:15:59,065 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:15:59,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:15:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1669873226, now seen corresponding path program 6 times [2024-06-28 00:15:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:15:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345275635] [2024-06-28 00:15:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:15:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:15:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345275635] [2024-06-28 00:16:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345275635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:09,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:09,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:16:09,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284777849] [2024-06-28 00:16:09,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:09,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:16:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:09,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:16:09,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:16:09,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:16:09,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 264 transitions, 4415 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:09,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:09,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:16:09,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:11,606 INFO L124 PetriNetUnfolderBase]: 3493/5385 cut-off events. [2024-06-28 00:16:11,606 INFO L125 PetriNetUnfolderBase]: For 341010/341043 co-relation queries the response was YES. [2024-06-28 00:16:11,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47020 conditions, 5385 events. 3493/5385 cut-off events. For 341010/341043 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 29362 event pairs, 803 based on Foata normal form. 44/5414 useless extension candidates. Maximal degree in co-relation 46921. Up to 4827 conditions per place. [2024-06-28 00:16:11,655 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 243 selfloop transitions, 63 changer transitions 0/309 dead transitions. [2024-06-28 00:16:11,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 309 transitions, 5218 flow [2024-06-28 00:16:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:16:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:16:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 00:16:11,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4021164021164021 [2024-06-28 00:16:11,658 INFO L175 Difference]: Start difference. First operand has 205 places, 264 transitions, 4415 flow. Second operand 9 states and 152 transitions. [2024-06-28 00:16:11,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 309 transitions, 5218 flow [2024-06-28 00:16:12,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 309 transitions, 5035 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-28 00:16:12,105 INFO L231 Difference]: Finished difference. Result has 208 places, 264 transitions, 4365 flow [2024-06-28 00:16:12,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4232, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4365, PETRI_PLACES=208, PETRI_TRANSITIONS=264} [2024-06-28 00:16:12,106 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places. [2024-06-28 00:16:12,106 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 264 transitions, 4365 flow [2024-06-28 00:16:12,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:12,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:12,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:12,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 00:16:12,107 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:12,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1642126264, now seen corresponding path program 2 times [2024-06-28 00:16:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107025004] [2024-06-28 00:16:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:18,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107025004] [2024-06-28 00:16:18,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107025004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:18,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:18,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:18,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353813273] [2024-06-28 00:16:18,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:18,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:18,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:18,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:18,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:18,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:16:18,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 264 transitions, 4365 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:18,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:18,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:16:18,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:21,199 INFO L124 PetriNetUnfolderBase]: 3513/5411 cut-off events. [2024-06-28 00:16:21,200 INFO L125 PetriNetUnfolderBase]: For 334908/334917 co-relation queries the response was YES. [2024-06-28 00:16:21,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47313 conditions, 5411 events. 3513/5411 cut-off events. For 334908/334917 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 29384 event pairs, 750 based on Foata normal form. 12/5418 useless extension candidates. Maximal degree in co-relation 47213. Up to 5124 conditions per place. [2024-06-28 00:16:21,261 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 239 selfloop transitions, 54 changer transitions 0/296 dead transitions. [2024-06-28 00:16:21,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 296 transitions, 5075 flow [2024-06-28 00:16:21,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:16:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:16:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 00:16:21,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-28 00:16:21,264 INFO L175 Difference]: Start difference. First operand has 208 places, 264 transitions, 4365 flow. Second operand 8 states and 132 transitions. [2024-06-28 00:16:21,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 296 transitions, 5075 flow [2024-06-28 00:16:21,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 296 transitions, 4939 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 00:16:21,728 INFO L231 Difference]: Finished difference. Result has 208 places, 266 transitions, 4390 flow [2024-06-28 00:16:21,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4229, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4390, PETRI_PLACES=208, PETRI_TRANSITIONS=266} [2024-06-28 00:16:21,729 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places. [2024-06-28 00:16:21,729 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 266 transitions, 4390 flow [2024-06-28 00:16:21,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:21,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:21,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:21,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 00:16:21,730 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:21,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash 954502342, now seen corresponding path program 3 times [2024-06-28 00:16:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727240827] [2024-06-28 00:16:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727240827] [2024-06-28 00:16:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727240827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:28,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:28,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472810935] [2024-06-28 00:16:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:28,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:28,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:28,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:28,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:28,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:16:28,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 266 transitions, 4390 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:28,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:28,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:16:28,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:31,120 INFO L124 PetriNetUnfolderBase]: 3533/5443 cut-off events. [2024-06-28 00:16:31,120 INFO L125 PetriNetUnfolderBase]: For 348532/348541 co-relation queries the response was YES. [2024-06-28 00:16:31,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47860 conditions, 5443 events. 3533/5443 cut-off events. For 348532/348541 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29644 event pairs, 807 based on Foata normal form. 12/5450 useless extension candidates. Maximal degree in co-relation 47759. Up to 5167 conditions per place. [2024-06-28 00:16:31,174 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 235 selfloop transitions, 59 changer transitions 0/297 dead transitions. [2024-06-28 00:16:31,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 297 transitions, 5120 flow [2024-06-28 00:16:31,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:16:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:16:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-28 00:16:31,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2024-06-28 00:16:31,177 INFO L175 Difference]: Start difference. First operand has 208 places, 266 transitions, 4390 flow. Second operand 9 states and 138 transitions. [2024-06-28 00:16:31,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 297 transitions, 5120 flow [2024-06-28 00:16:31,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 297 transitions, 4995 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 00:16:31,578 INFO L231 Difference]: Finished difference. Result has 211 places, 268 transitions, 4457 flow [2024-06-28 00:16:31,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4265, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4457, PETRI_PLACES=211, PETRI_TRANSITIONS=268} [2024-06-28 00:16:31,579 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 168 predicate places. [2024-06-28 00:16:31,579 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 268 transitions, 4457 flow [2024-06-28 00:16:31,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:31,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:31,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:31,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 00:16:31,580 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:31,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1997465579, now seen corresponding path program 1 times [2024-06-28 00:16:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:31,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660898262] [2024-06-28 00:16:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:38,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660898262] [2024-06-28 00:16:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660898262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:38,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:38,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:38,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161476022] [2024-06-28 00:16:38,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:38,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:38,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:38,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:38,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:38,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:16:38,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 268 transitions, 4457 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:38,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:38,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:16:38,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:41,657 INFO L124 PetriNetUnfolderBase]: 3564/5490 cut-off events. [2024-06-28 00:16:41,657 INFO L125 PetriNetUnfolderBase]: For 359028/359037 co-relation queries the response was YES. [2024-06-28 00:16:41,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48504 conditions, 5490 events. 3564/5490 cut-off events. For 359028/359037 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 29985 event pairs, 803 based on Foata normal form. 10/5495 useless extension candidates. Maximal degree in co-relation 48402. Up to 5176 conditions per place. [2024-06-28 00:16:41,710 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 240 selfloop transitions, 82 changer transitions 0/325 dead transitions. [2024-06-28 00:16:41,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 325 transitions, 5474 flow [2024-06-28 00:16:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:16:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:16:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2024-06-28 00:16:41,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3498168498168498 [2024-06-28 00:16:41,713 INFO L175 Difference]: Start difference. First operand has 211 places, 268 transitions, 4457 flow. Second operand 13 states and 191 transitions. [2024-06-28 00:16:41,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 325 transitions, 5474 flow [2024-06-28 00:16:42,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 325 transitions, 5282 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-28 00:16:42,244 INFO L231 Difference]: Finished difference. Result has 219 places, 283 transitions, 4731 flow [2024-06-28 00:16:42,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4285, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4731, PETRI_PLACES=219, PETRI_TRANSITIONS=283} [2024-06-28 00:16:42,245 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 176 predicate places. [2024-06-28 00:16:42,245 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 283 transitions, 4731 flow [2024-06-28 00:16:42,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:42,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:42,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:42,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 00:16:42,246 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:42,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:42,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1831351800, now seen corresponding path program 7 times [2024-06-28 00:16:42,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:42,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649764953] [2024-06-28 00:16:42,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:16:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:16:49,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:16:49,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649764953] [2024-06-28 00:16:49,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649764953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:16:49,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:16:49,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:16:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081084289] [2024-06-28 00:16:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:16:49,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:16:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:16:49,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:16:49,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:16:49,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:16:49,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 283 transitions, 4731 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:49,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:16:49,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:16:49,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:16:51,562 INFO L124 PetriNetUnfolderBase]: 3584/5522 cut-off events. [2024-06-28 00:16:51,563 INFO L125 PetriNetUnfolderBase]: For 376946/376955 co-relation queries the response was YES. [2024-06-28 00:16:51,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49644 conditions, 5522 events. 3584/5522 cut-off events. For 376946/376955 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 30189 event pairs, 796 based on Foata normal form. 12/5529 useless extension candidates. Maximal degree in co-relation 49539. Up to 5307 conditions per place. [2024-06-28 00:16:51,615 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 270 selfloop transitions, 46 changer transitions 0/319 dead transitions. [2024-06-28 00:16:51,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 319 transitions, 5522 flow [2024-06-28 00:16:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:16:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:16:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-28 00:16:51,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-28 00:16:51,617 INFO L175 Difference]: Start difference. First operand has 219 places, 283 transitions, 4731 flow. Second operand 8 states and 135 transitions. [2024-06-28 00:16:51,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 319 transitions, 5522 flow [2024-06-28 00:16:52,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 319 transitions, 5227 flow, removed 47 selfloop flow, removed 10 redundant places. [2024-06-28 00:16:52,136 INFO L231 Difference]: Finished difference. Result has 217 places, 285 transitions, 4592 flow [2024-06-28 00:16:52,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4436, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4592, PETRI_PLACES=217, PETRI_TRANSITIONS=285} [2024-06-28 00:16:52,137 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places. [2024-06-28 00:16:52,137 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 285 transitions, 4592 flow [2024-06-28 00:16:52,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:16:52,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:16:52,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:16:52,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 00:16:52,137 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:16:52,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:16:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1991895654, now seen corresponding path program 8 times [2024-06-28 00:16:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:16:52,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425602550] [2024-06-28 00:16:52,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:16:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:16:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425602550] [2024-06-28 00:17:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425602550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:17:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419243990] [2024-06-28 00:17:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:00,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:17:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:17:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:17:00,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:17:00,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 285 transitions, 4592 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:00,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:00,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:17:00,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:02,747 INFO L124 PetriNetUnfolderBase]: 3680/5682 cut-off events. [2024-06-28 00:17:02,748 INFO L125 PetriNetUnfolderBase]: For 415670/415679 co-relation queries the response was YES. [2024-06-28 00:17:02,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50798 conditions, 5682 events. 3680/5682 cut-off events. For 415670/415679 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 31358 event pairs, 814 based on Foata normal form. 32/5709 useless extension candidates. Maximal degree in co-relation 50695. Up to 5169 conditions per place. [2024-06-28 00:17:02,808 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 255 selfloop transitions, 69 changer transitions 0/327 dead transitions. [2024-06-28 00:17:02,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 327 transitions, 5515 flow [2024-06-28 00:17:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:17:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:17:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-28 00:17:02,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3738095238095238 [2024-06-28 00:17:02,812 INFO L175 Difference]: Start difference. First operand has 217 places, 285 transitions, 4592 flow. Second operand 10 states and 157 transitions. [2024-06-28 00:17:02,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 327 transitions, 5515 flow [2024-06-28 00:17:03,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 327 transitions, 5339 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-28 00:17:03,305 INFO L231 Difference]: Finished difference. Result has 222 places, 289 transitions, 4696 flow [2024-06-28 00:17:03,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4416, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4696, PETRI_PLACES=222, PETRI_TRANSITIONS=289} [2024-06-28 00:17:03,306 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 179 predicate places. [2024-06-28 00:17:03,306 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 289 transitions, 4696 flow [2024-06-28 00:17:03,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:03,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:03,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:03,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 00:17:03,306 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:03,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash 948938152, now seen corresponding path program 4 times [2024-06-28 00:17:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:03,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092510943] [2024-06-28 00:17:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:03,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:10,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092510943] [2024-06-28 00:17:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092510943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:10,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157630450] [2024-06-28 00:17:10,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:10,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:10,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:10,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:10,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:17:10,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 289 transitions, 4696 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:10,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:10,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:17:10,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:13,033 INFO L124 PetriNetUnfolderBase]: 3700/5715 cut-off events. [2024-06-28 00:17:13,034 INFO L125 PetriNetUnfolderBase]: For 423454/423463 co-relation queries the response was YES. [2024-06-28 00:17:13,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51504 conditions, 5715 events. 3700/5715 cut-off events. For 423454/423463 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 31561 event pairs, 835 based on Foata normal form. 12/5722 useless extension candidates. Maximal degree in co-relation 51399. Up to 5276 conditions per place. [2024-06-28 00:17:13,095 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 233 selfloop transitions, 84 changer transitions 0/320 dead transitions. [2024-06-28 00:17:13,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 320 transitions, 5488 flow [2024-06-28 00:17:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:17:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:17:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-28 00:17:13,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2024-06-28 00:17:13,098 INFO L175 Difference]: Start difference. First operand has 222 places, 289 transitions, 4696 flow. Second operand 9 states and 138 transitions. [2024-06-28 00:17:13,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 320 transitions, 5488 flow [2024-06-28 00:17:13,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 320 transitions, 5259 flow, removed 54 selfloop flow, removed 7 redundant places. [2024-06-28 00:17:13,684 INFO L231 Difference]: Finished difference. Result has 224 places, 291 transitions, 4714 flow [2024-06-28 00:17:13,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4714, PETRI_PLACES=224, PETRI_TRANSITIONS=291} [2024-06-28 00:17:13,685 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places. [2024-06-28 00:17:13,685 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 291 transitions, 4714 flow [2024-06-28 00:17:13,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:13,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:13,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:13,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 00:17:13,685 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:13,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1825841550, now seen corresponding path program 9 times [2024-06-28 00:17:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634431264] [2024-06-28 00:17:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634431264] [2024-06-28 00:17:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634431264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:21,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299149112] [2024-06-28 00:17:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:21,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:21,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:17:21,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 291 transitions, 4714 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:21,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:21,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:17:21,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:23,520 INFO L124 PetriNetUnfolderBase]: 3720/5746 cut-off events. [2024-06-28 00:17:23,520 INFO L125 PetriNetUnfolderBase]: For 422604/422613 co-relation queries the response was YES. [2024-06-28 00:17:23,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51617 conditions, 5746 events. 3720/5746 cut-off events. For 422604/422613 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 31771 event pairs, 804 based on Foata normal form. 12/5753 useless extension candidates. Maximal degree in co-relation 51511. Up to 5158 conditions per place. [2024-06-28 00:17:23,582 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 252 selfloop transitions, 78 changer transitions 0/333 dead transitions. [2024-06-28 00:17:23,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 333 transitions, 5829 flow [2024-06-28 00:17:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:17:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:17:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-28 00:17:23,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2024-06-28 00:17:23,585 INFO L175 Difference]: Start difference. First operand has 224 places, 291 transitions, 4714 flow. Second operand 8 states and 139 transitions. [2024-06-28 00:17:23,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 333 transitions, 5829 flow [2024-06-28 00:17:24,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 333 transitions, 5600 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-28 00:17:24,050 INFO L231 Difference]: Finished difference. Result has 226 places, 296 transitions, 4817 flow [2024-06-28 00:17:24,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4485, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4817, PETRI_PLACES=226, PETRI_TRANSITIONS=296} [2024-06-28 00:17:24,051 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places. [2024-06-28 00:17:24,051 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 296 transitions, 4817 flow [2024-06-28 00:17:24,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:24,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:24,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:24,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 00:17:24,051 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:24,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1991751659, now seen corresponding path program 2 times [2024-06-28 00:17:24,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:24,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599990474] [2024-06-28 00:17:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:24,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:31,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:31,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599990474] [2024-06-28 00:17:31,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599990474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:31,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:31,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:17:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518345867] [2024-06-28 00:17:31,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:31,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:17:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:31,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:17:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:17:31,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:17:31,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 296 transitions, 4817 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:31,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:31,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:17:31,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:34,237 INFO L124 PetriNetUnfolderBase]: 3715/5740 cut-off events. [2024-06-28 00:17:34,237 INFO L125 PetriNetUnfolderBase]: For 429122/429131 co-relation queries the response was YES. [2024-06-28 00:17:34,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51974 conditions, 5740 events. 3715/5740 cut-off events. For 429122/429131 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 31842 event pairs, 735 based on Foata normal form. 10/5745 useless extension candidates. Maximal degree in co-relation 51867. Up to 4892 conditions per place. [2024-06-28 00:17:34,301 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 197 selfloop transitions, 132 changer transitions 0/332 dead transitions. [2024-06-28 00:17:34,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 332 transitions, 5787 flow [2024-06-28 00:17:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:17:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:17:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-28 00:17:34,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-28 00:17:34,303 INFO L175 Difference]: Start difference. First operand has 226 places, 296 transitions, 4817 flow. Second operand 7 states and 138 transitions. [2024-06-28 00:17:34,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 332 transitions, 5787 flow [2024-06-28 00:17:35,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 332 transitions, 5607 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-28 00:17:35,108 INFO L231 Difference]: Finished difference. Result has 229 places, 296 transitions, 4913 flow [2024-06-28 00:17:35,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4637, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4913, PETRI_PLACES=229, PETRI_TRANSITIONS=296} [2024-06-28 00:17:35,109 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places. [2024-06-28 00:17:35,109 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 296 transitions, 4913 flow [2024-06-28 00:17:35,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:35,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:35,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:35,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 00:17:35,109 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:35,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1825845270, now seen corresponding path program 10 times [2024-06-28 00:17:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:35,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749950063] [2024-06-28 00:17:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:35,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:42,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749950063] [2024-06-28 00:17:42,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749950063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:42,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:17:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429290914] [2024-06-28 00:17:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:42,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:17:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:42,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:17:42,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:17:43,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:17:43,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 296 transitions, 4913 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:43,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:43,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:17:43,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:45,497 INFO L124 PetriNetUnfolderBase]: 3775/5843 cut-off events. [2024-06-28 00:17:45,497 INFO L125 PetriNetUnfolderBase]: For 469047/469056 co-relation queries the response was YES. [2024-06-28 00:17:45,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53313 conditions, 5843 events. 3775/5843 cut-off events. For 469047/469056 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 32578 event pairs, 826 based on Foata normal form. 28/5866 useless extension candidates. Maximal degree in co-relation 53204. Up to 5203 conditions per place. [2024-06-28 00:17:45,567 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 240 selfloop transitions, 94 changer transitions 0/337 dead transitions. [2024-06-28 00:17:45,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 337 transitions, 6003 flow [2024-06-28 00:17:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:17:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:17:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-28 00:17:45,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-28 00:17:45,570 INFO L175 Difference]: Start difference. First operand has 229 places, 296 transitions, 4913 flow. Second operand 10 states and 158 transitions. [2024-06-28 00:17:45,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 337 transitions, 6003 flow [2024-06-28 00:17:46,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 337 transitions, 5726 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-06-28 00:17:46,268 INFO L231 Difference]: Finished difference. Result has 234 places, 297 transitions, 4888 flow [2024-06-28 00:17:46,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4642, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4888, PETRI_PLACES=234, PETRI_TRANSITIONS=297} [2024-06-28 00:17:46,269 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 191 predicate places. [2024-06-28 00:17:46,269 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 297 transitions, 4888 flow [2024-06-28 00:17:46,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:46,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:46,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:46,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 00:17:46,270 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:46,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash 317316115, now seen corresponding path program 1 times [2024-06-28 00:17:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:46,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423617141] [2024-06-28 00:17:46,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:46,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:17:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:17:51,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:17:51,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423617141] [2024-06-28 00:17:51,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423617141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:17:51,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:17:51,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:17:51,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356287183] [2024-06-28 00:17:51,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:17:51,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:17:51,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:17:51,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:17:51,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:17:51,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:17:51,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 297 transitions, 4888 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:51,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:17:51,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:17:51,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:17:54,271 INFO L124 PetriNetUnfolderBase]: 3827/5920 cut-off events. [2024-06-28 00:17:54,272 INFO L125 PetriNetUnfolderBase]: For 456119/456134 co-relation queries the response was YES. [2024-06-28 00:17:54,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53982 conditions, 5920 events. 3827/5920 cut-off events. For 456119/456134 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 33245 event pairs, 833 based on Foata normal form. 14/5923 useless extension candidates. Maximal degree in co-relation 53870. Up to 5569 conditions per place. [2024-06-28 00:17:54,463 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 272 selfloop transitions, 62 changer transitions 0/337 dead transitions. [2024-06-28 00:17:54,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 337 transitions, 6154 flow [2024-06-28 00:17:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:17:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:17:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-28 00:17:54,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 00:17:54,469 INFO L175 Difference]: Start difference. First operand has 234 places, 297 transitions, 4888 flow. Second operand 6 states and 108 transitions. [2024-06-28 00:17:54,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 337 transitions, 6154 flow [2024-06-28 00:17:54,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 337 transitions, 5937 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-28 00:17:54,965 INFO L231 Difference]: Finished difference. Result has 234 places, 311 transitions, 5120 flow [2024-06-28 00:17:54,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4671, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5120, PETRI_PLACES=234, PETRI_TRANSITIONS=311} [2024-06-28 00:17:54,965 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 191 predicate places. [2024-06-28 00:17:54,965 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 311 transitions, 5120 flow [2024-06-28 00:17:54,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:17:54,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:17:54,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:17:54,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 00:17:54,966 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:17:54,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:17:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1279852554, now seen corresponding path program 5 times [2024-06-28 00:17:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:17:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21838711] [2024-06-28 00:17:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:17:54,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:17:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:02,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:02,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21838711] [2024-06-28 00:18:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21838711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:02,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:02,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:18:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197025717] [2024-06-28 00:18:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:02,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:18:02,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:02,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:18:02,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:18:02,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:18:02,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 311 transitions, 5120 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:02,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:02,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:18:02,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:05,298 INFO L124 PetriNetUnfolderBase]: 3840/5935 cut-off events. [2024-06-28 00:18:05,298 INFO L125 PetriNetUnfolderBase]: For 465195/465204 co-relation queries the response was YES. [2024-06-28 00:18:05,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54952 conditions, 5935 events. 3840/5935 cut-off events. For 465195/465204 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 33213 event pairs, 743 based on Foata normal form. 12/5942 useless extension candidates. Maximal degree in co-relation 54836. Up to 5221 conditions per place. [2024-06-28 00:18:05,376 INFO L140 encePairwiseOnDemand]: 26/42 looper letters, 251 selfloop transitions, 111 changer transitions 0/365 dead transitions. [2024-06-28 00:18:05,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 365 transitions, 6439 flow [2024-06-28 00:18:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:18:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:18:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2024-06-28 00:18:05,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2024-06-28 00:18:05,378 INFO L175 Difference]: Start difference. First operand has 234 places, 311 transitions, 5120 flow. Second operand 11 states and 184 transitions. [2024-06-28 00:18:05,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 365 transitions, 6439 flow [2024-06-28 00:18:06,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 365 transitions, 6391 flow, removed 22 selfloop flow, removed 1 redundant places. [2024-06-28 00:18:06,206 INFO L231 Difference]: Finished difference. Result has 245 places, 316 transitions, 5507 flow [2024-06-28 00:18:06,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5072, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5507, PETRI_PLACES=245, PETRI_TRANSITIONS=316} [2024-06-28 00:18:06,207 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 202 predicate places. [2024-06-28 00:18:06,207 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 316 transitions, 5507 flow [2024-06-28 00:18:06,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:06,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:06,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:06,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 00:18:06,208 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:06,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash -654328389, now seen corresponding path program 3 times [2024-06-28 00:18:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357571249] [2024-06-28 00:18:06,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:16,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357571249] [2024-06-28 00:18:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357571249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:16,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:16,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:18:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970502930] [2024-06-28 00:18:16,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:16,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:18:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:16,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:18:16,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:18:16,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:18:16,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 316 transitions, 5507 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:16,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:16,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:18:16,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:18,934 INFO L124 PetriNetUnfolderBase]: 3835/5927 cut-off events. [2024-06-28 00:18:18,935 INFO L125 PetriNetUnfolderBase]: For 485237/485246 co-relation queries the response was YES. [2024-06-28 00:18:19,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56696 conditions, 5927 events. 3835/5927 cut-off events. For 485237/485246 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 33057 event pairs, 825 based on Foata normal form. 10/5932 useless extension candidates. Maximal degree in co-relation 56576. Up to 5574 conditions per place. [2024-06-28 00:18:19,134 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 269 selfloop transitions, 77 changer transitions 0/349 dead transitions. [2024-06-28 00:18:19,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 349 transitions, 6306 flow [2024-06-28 00:18:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:18:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:18:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-28 00:18:19,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2024-06-28 00:18:19,150 INFO L175 Difference]: Start difference. First operand has 245 places, 316 transitions, 5507 flow. Second operand 10 states and 155 transitions. [2024-06-28 00:18:19,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 349 transitions, 6306 flow [2024-06-28 00:18:19,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 349 transitions, 6071 flow, removed 46 selfloop flow, removed 9 redundant places. [2024-06-28 00:18:19,987 INFO L231 Difference]: Finished difference. Result has 246 places, 316 transitions, 5445 flow [2024-06-28 00:18:19,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5272, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5445, PETRI_PLACES=246, PETRI_TRANSITIONS=316} [2024-06-28 00:18:19,987 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places. [2024-06-28 00:18:19,987 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 316 transitions, 5445 flow [2024-06-28 00:18:19,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:19,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:19,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:19,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 00:18:19,988 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:19,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:19,990 INFO L85 PathProgramCache]: Analyzing trace with hash -388421642, now seen corresponding path program 6 times [2024-06-28 00:18:19,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:19,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926888578] [2024-06-28 00:18:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:26,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926888578] [2024-06-28 00:18:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926888578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:26,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:26,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:26,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140243988] [2024-06-28 00:18:26,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:26,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:26,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:26,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:26,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:26,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:18:26,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 316 transitions, 5445 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:26,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:26,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:18:26,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:28,957 INFO L124 PetriNetUnfolderBase]: 3855/5959 cut-off events. [2024-06-28 00:18:28,958 INFO L125 PetriNetUnfolderBase]: For 501999/502008 co-relation queries the response was YES. [2024-06-28 00:18:29,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57276 conditions, 5959 events. 3855/5959 cut-off events. For 501999/502008 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33258 event pairs, 763 based on Foata normal form. 12/5966 useless extension candidates. Maximal degree in co-relation 57154. Up to 5583 conditions per place. [2024-06-28 00:18:29,033 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 288 selfloop transitions, 58 changer transitions 0/349 dead transitions. [2024-06-28 00:18:29,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 349 transitions, 6285 flow [2024-06-28 00:18:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-28 00:18:29,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35978835978835977 [2024-06-28 00:18:29,035 INFO L175 Difference]: Start difference. First operand has 246 places, 316 transitions, 5445 flow. Second operand 9 states and 136 transitions. [2024-06-28 00:18:29,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 349 transitions, 6285 flow [2024-06-28 00:18:29,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 349 transitions, 6146 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 00:18:29,977 INFO L231 Difference]: Finished difference. Result has 247 places, 318 transitions, 5487 flow [2024-06-28 00:18:29,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5306, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5487, PETRI_PLACES=247, PETRI_TRANSITIONS=318} [2024-06-28 00:18:29,978 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2024-06-28 00:18:29,978 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 318 transitions, 5487 flow [2024-06-28 00:18:29,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:29,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:29,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:29,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 00:18:29,979 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:29,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash -397618412, now seen corresponding path program 7 times [2024-06-28 00:18:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325277390] [2024-06-28 00:18:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325277390] [2024-06-28 00:18:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325277390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112823729] [2024-06-28 00:18:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:36,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:36,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:36,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:36,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:18:37,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 318 transitions, 5487 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:37,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:37,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:18:37,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:39,821 INFO L124 PetriNetUnfolderBase]: 3847/5947 cut-off events. [2024-06-28 00:18:39,821 INFO L125 PetriNetUnfolderBase]: For 512142/512151 co-relation queries the response was YES. [2024-06-28 00:18:39,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57302 conditions, 5947 events. 3847/5947 cut-off events. For 512142/512151 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 33214 event pairs, 823 based on Foata normal form. 12/5954 useless extension candidates. Maximal degree in co-relation 57179. Up to 5651 conditions per place. [2024-06-28 00:18:39,888 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 287 selfloop transitions, 59 changer transitions 0/349 dead transitions. [2024-06-28 00:18:39,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 349 transitions, 6301 flow [2024-06-28 00:18:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-06-28 00:18:39,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36243386243386244 [2024-06-28 00:18:39,891 INFO L175 Difference]: Start difference. First operand has 247 places, 318 transitions, 5487 flow. Second operand 9 states and 137 transitions. [2024-06-28 00:18:39,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 349 transitions, 6301 flow [2024-06-28 00:18:40,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 349 transitions, 6164 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-28 00:18:40,755 INFO L231 Difference]: Finished difference. Result has 249 places, 319 transitions, 5504 flow [2024-06-28 00:18:40,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5350, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5504, PETRI_PLACES=249, PETRI_TRANSITIONS=319} [2024-06-28 00:18:40,755 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places. [2024-06-28 00:18:40,756 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 319 transitions, 5504 flow [2024-06-28 00:18:40,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:40,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:40,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:40,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 00:18:40,756 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:40,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash -397625852, now seen corresponding path program 8 times [2024-06-28 00:18:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:40,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638982373] [2024-06-28 00:18:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:48,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638982373] [2024-06-28 00:18:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638982373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:48,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:18:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085442313] [2024-06-28 00:18:48,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:48,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:18:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:18:48,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:18:48,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:18:48,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 319 transitions, 5504 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:48,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:48,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:18:48,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:18:51,004 INFO L124 PetriNetUnfolderBase]: 3839/5935 cut-off events. [2024-06-28 00:18:51,004 INFO L125 PetriNetUnfolderBase]: For 521776/521785 co-relation queries the response was YES. [2024-06-28 00:18:51,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57298 conditions, 5935 events. 3839/5935 cut-off events. For 521776/521785 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 33158 event pairs, 825 based on Foata normal form. 12/5942 useless extension candidates. Maximal degree in co-relation 57174. Up to 5593 conditions per place. [2024-06-28 00:18:51,066 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 278 selfloop transitions, 68 changer transitions 0/349 dead transitions. [2024-06-28 00:18:51,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 349 transitions, 6304 flow [2024-06-28 00:18:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:18:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:18:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2024-06-28 00:18:51,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36772486772486773 [2024-06-28 00:18:51,069 INFO L175 Difference]: Start difference. First operand has 249 places, 319 transitions, 5504 flow. Second operand 9 states and 139 transitions. [2024-06-28 00:18:51,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 349 transitions, 6304 flow [2024-06-28 00:18:52,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 349 transitions, 6161 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 00:18:52,171 INFO L231 Difference]: Finished difference. Result has 251 places, 320 transitions, 5524 flow [2024-06-28 00:18:52,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5361, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5524, PETRI_PLACES=251, PETRI_TRANSITIONS=320} [2024-06-28 00:18:52,172 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places. [2024-06-28 00:18:52,172 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 320 transitions, 5524 flow [2024-06-28 00:18:52,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:52,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:18:52,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:18:52,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 00:18:52,173 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:18:52,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:18:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -854797583, now seen corresponding path program 2 times [2024-06-28 00:18:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:18:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988240610] [2024-06-28 00:18:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:18:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:18:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:18:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:18:57,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:18:57,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988240610] [2024-06-28 00:18:57,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988240610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:18:57,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:18:57,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:18:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217587537] [2024-06-28 00:18:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:18:57,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:18:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:18:57,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:18:57,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:18:57,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:18:57,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 320 transitions, 5524 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:18:57,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:18:57,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:18:57,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:00,469 INFO L124 PetriNetUnfolderBase]: 3999/6159 cut-off events. [2024-06-28 00:19:00,469 INFO L125 PetriNetUnfolderBase]: For 573467/573470 co-relation queries the response was YES. [2024-06-28 00:19:00,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59979 conditions, 6159 events. 3999/6159 cut-off events. For 573467/573470 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 34516 event pairs, 867 based on Foata normal form. 14/6170 useless extension candidates. Maximal degree in co-relation 59854. Up to 5970 conditions per place. [2024-06-28 00:19:00,544 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 319 selfloop transitions, 33 changer transitions 0/355 dead transitions. [2024-06-28 00:19:00,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 355 transitions, 6755 flow [2024-06-28 00:19:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:19:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:19:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-28 00:19:00,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2024-06-28 00:19:00,546 INFO L175 Difference]: Start difference. First operand has 251 places, 320 transitions, 5524 flow. Second operand 8 states and 117 transitions. [2024-06-28 00:19:00,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 355 transitions, 6755 flow [2024-06-28 00:19:01,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 355 transitions, 6603 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-28 00:19:01,477 INFO L231 Difference]: Finished difference. Result has 253 places, 337 transitions, 5816 flow [2024-06-28 00:19:01,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5372, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5816, PETRI_PLACES=253, PETRI_TRANSITIONS=337} [2024-06-28 00:19:01,479 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places. [2024-06-28 00:19:01,479 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 337 transitions, 5816 flow [2024-06-28 00:19:01,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:01,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:01,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:01,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 00:19:01,479 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:01,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1538070355, now seen corresponding path program 3 times [2024-06-28 00:19:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349886251] [2024-06-28 00:19:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:06,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:06,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349886251] [2024-06-28 00:19:06,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349886251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:06,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:06,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:19:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346288309] [2024-06-28 00:19:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:06,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:19:06,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:06,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:19:06,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:19:06,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:19:06,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 337 transitions, 5816 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:06,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:06,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:19:06,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:09,084 INFO L124 PetriNetUnfolderBase]: 4013/6182 cut-off events. [2024-06-28 00:19:09,085 INFO L125 PetriNetUnfolderBase]: For 575235/575249 co-relation queries the response was YES. [2024-06-28 00:19:09,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60946 conditions, 6182 events. 4013/6182 cut-off events. For 575235/575249 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 34770 event pairs, 887 based on Foata normal form. 12/6185 useless extension candidates. Maximal degree in co-relation 60819. Up to 5799 conditions per place. [2024-06-28 00:19:09,165 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 297 selfloop transitions, 78 changer transitions 0/378 dead transitions. [2024-06-28 00:19:09,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 378 transitions, 7136 flow [2024-06-28 00:19:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:19:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:19:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-28 00:19:09,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-28 00:19:09,167 INFO L175 Difference]: Start difference. First operand has 253 places, 337 transitions, 5816 flow. Second operand 7 states and 127 transitions. [2024-06-28 00:19:09,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 378 transitions, 7136 flow [2024-06-28 00:19:10,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 378 transitions, 6941 flow, removed 74 selfloop flow, removed 4 redundant places. [2024-06-28 00:19:10,191 INFO L231 Difference]: Finished difference. Result has 256 places, 344 transitions, 5937 flow [2024-06-28 00:19:10,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5635, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5937, PETRI_PLACES=256, PETRI_TRANSITIONS=344} [2024-06-28 00:19:10,193 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places. [2024-06-28 00:19:10,193 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 344 transitions, 5937 flow [2024-06-28 00:19:10,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:10,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:10,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:10,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 00:19:10,193 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:10,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1470410742, now seen corresponding path program 1 times [2024-06-28 00:19:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:10,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522684306] [2024-06-28 00:19:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522684306] [2024-06-28 00:19:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522684306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:21,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:21,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:19:21,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657682712] [2024-06-28 00:19:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:21,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:19:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:19:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:19:21,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:19:21,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 344 transitions, 5937 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:21,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:21,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:19:21,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:24,068 INFO L124 PetriNetUnfolderBase]: 4061/6269 cut-off events. [2024-06-28 00:19:24,068 INFO L125 PetriNetUnfolderBase]: For 611174/611201 co-relation queries the response was YES. [2024-06-28 00:19:24,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61716 conditions, 6269 events. 4061/6269 cut-off events. For 611174/611201 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 35522 event pairs, 864 based on Foata normal form. 32/6286 useless extension candidates. Maximal degree in co-relation 61589. Up to 5775 conditions per place. [2024-06-28 00:19:24,139 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 322 selfloop transitions, 62 changer transitions 0/387 dead transitions. [2024-06-28 00:19:24,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 387 transitions, 6917 flow [2024-06-28 00:19:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:19:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:19:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-28 00:19:24,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3941798941798942 [2024-06-28 00:19:24,142 INFO L175 Difference]: Start difference. First operand has 256 places, 344 transitions, 5937 flow. Second operand 9 states and 149 transitions. [2024-06-28 00:19:24,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 387 transitions, 6917 flow [2024-06-28 00:19:25,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 387 transitions, 6795 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-28 00:19:25,086 INFO L231 Difference]: Finished difference. Result has 262 places, 345 transitions, 5999 flow [2024-06-28 00:19:25,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5815, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5999, PETRI_PLACES=262, PETRI_TRANSITIONS=345} [2024-06-28 00:19:25,087 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places. [2024-06-28 00:19:25,087 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 345 transitions, 5999 flow [2024-06-28 00:19:25,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:25,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:25,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:25,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 00:19:25,087 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:25,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1246569128, now seen corresponding path program 1 times [2024-06-28 00:19:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887225417] [2024-06-28 00:19:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:31,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:31,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887225417] [2024-06-28 00:19:31,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887225417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:31,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:31,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:19:31,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311117812] [2024-06-28 00:19:31,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:31,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:19:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:19:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:19:31,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:19:31,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 345 transitions, 5999 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:31,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:31,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:19:31,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:33,527 INFO L124 PetriNetUnfolderBase]: 4089/6301 cut-off events. [2024-06-28 00:19:33,527 INFO L125 PetriNetUnfolderBase]: For 609566/609575 co-relation queries the response was YES. [2024-06-28 00:19:33,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62587 conditions, 6301 events. 4089/6301 cut-off events. For 609566/609575 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 35562 event pairs, 884 based on Foata normal form. 9/6307 useless extension candidates. Maximal degree in co-relation 62458. Up to 6203 conditions per place. [2024-06-28 00:19:33,609 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 351 selfloop transitions, 36 changer transitions 0/390 dead transitions. [2024-06-28 00:19:33,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 390 transitions, 7369 flow [2024-06-28 00:19:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:19:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:19:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-28 00:19:33,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391156462585034 [2024-06-28 00:19:33,612 INFO L175 Difference]: Start difference. First operand has 262 places, 345 transitions, 5999 flow. Second operand 7 states and 115 transitions. [2024-06-28 00:19:33,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 390 transitions, 7369 flow [2024-06-28 00:19:34,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 390 transitions, 7205 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-28 00:19:34,682 INFO L231 Difference]: Finished difference. Result has 265 places, 367 transitions, 6400 flow [2024-06-28 00:19:34,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5841, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6400, PETRI_PLACES=265, PETRI_TRANSITIONS=367} [2024-06-28 00:19:34,683 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 222 predicate places. [2024-06-28 00:19:34,683 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 367 transitions, 6400 flow [2024-06-28 00:19:34,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:34,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:34,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:34,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 00:19:34,684 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:34,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash 768795946, now seen corresponding path program 2 times [2024-06-28 00:19:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165471107] [2024-06-28 00:19:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:34,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:42,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:42,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165471107] [2024-06-28 00:19:42,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165471107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:42,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:42,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:19:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304836978] [2024-06-28 00:19:42,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:42,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:19:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:19:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:19:42,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:19:42,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 367 transitions, 6400 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:42,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:42,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:19:42,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:45,241 INFO L124 PetriNetUnfolderBase]: 4300/6629 cut-off events. [2024-06-28 00:19:45,242 INFO L125 PetriNetUnfolderBase]: For 690374/690401 co-relation queries the response was YES. [2024-06-28 00:19:45,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66750 conditions, 6629 events. 4300/6629 cut-off events. For 690374/690401 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 37672 event pairs, 755 based on Foata normal form. 36/6660 useless extension candidates. Maximal degree in co-relation 66616. Up to 5497 conditions per place. [2024-06-28 00:19:45,317 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 303 selfloop transitions, 127 changer transitions 0/433 dead transitions. [2024-06-28 00:19:45,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 433 transitions, 7776 flow [2024-06-28 00:19:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:19:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:19:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-28 00:19:45,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 00:19:45,320 INFO L175 Difference]: Start difference. First operand has 265 places, 367 transitions, 6400 flow. Second operand 10 states and 180 transitions. [2024-06-28 00:19:45,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 433 transitions, 7776 flow [2024-06-28 00:19:46,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 433 transitions, 7690 flow, removed 41 selfloop flow, removed 1 redundant places. [2024-06-28 00:19:46,257 INFO L231 Difference]: Finished difference. Result has 275 places, 374 transitions, 6786 flow [2024-06-28 00:19:46,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6314, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6786, PETRI_PLACES=275, PETRI_TRANSITIONS=374} [2024-06-28 00:19:46,258 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 232 predicate places. [2024-06-28 00:19:46,258 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 374 transitions, 6786 flow [2024-06-28 00:19:46,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:46,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:46,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:46,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-28 00:19:46,259 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:46,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1791893792, now seen corresponding path program 1 times [2024-06-28 00:19:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626457259] [2024-06-28 00:19:46,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:19:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:19:53,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:19:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626457259] [2024-06-28 00:19:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626457259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:19:53,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:19:53,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:19:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350713627] [2024-06-28 00:19:53,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:19:53,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:19:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:19:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:19:53,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:19:53,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:19:53,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 374 transitions, 6786 flow. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:53,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:19:53,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:19:53,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:19:57,055 INFO L124 PetriNetUnfolderBase]: 4408/6817 cut-off events. [2024-06-28 00:19:57,056 INFO L125 PetriNetUnfolderBase]: For 761960/761981 co-relation queries the response was YES. [2024-06-28 00:19:57,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70141 conditions, 6817 events. 4408/6817 cut-off events. For 761960/761981 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 39307 event pairs, 952 based on Foata normal form. 50/6862 useless extension candidates. Maximal degree in co-relation 70004. Up to 6265 conditions per place. [2024-06-28 00:19:57,137 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 334 selfloop transitions, 76 changer transitions 0/413 dead transitions. [2024-06-28 00:19:57,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 413 transitions, 7869 flow [2024-06-28 00:19:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:19:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:19:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-28 00:19:57,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-28 00:19:57,140 INFO L175 Difference]: Start difference. First operand has 275 places, 374 transitions, 6786 flow. Second operand 10 states and 156 transitions. [2024-06-28 00:19:57,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 413 transitions, 7869 flow [2024-06-28 00:19:58,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 413 transitions, 7735 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-28 00:19:58,206 INFO L231 Difference]: Finished difference. Result has 279 places, 376 transitions, 6925 flow [2024-06-28 00:19:58,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6652, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6925, PETRI_PLACES=279, PETRI_TRANSITIONS=376} [2024-06-28 00:19:58,207 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places. [2024-06-28 00:19:58,207 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 376 transitions, 6925 flow [2024-06-28 00:19:58,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:19:58,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:19:58,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:19:58,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-28 00:19:58,208 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:19:58,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:19:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash 943774530, now seen corresponding path program 3 times [2024-06-28 00:19:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:19:58,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286654768] [2024-06-28 00:19:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:19:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:19:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286654768] [2024-06-28 00:20:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286654768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551747471] [2024-06-28 00:20:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:06,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:06,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:06,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:06,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:20:06,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 376 transitions, 6925 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:06,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:06,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:20:06,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:09,113 INFO L124 PetriNetUnfolderBase]: 4456/6901 cut-off events. [2024-06-28 00:20:09,113 INFO L125 PetriNetUnfolderBase]: For 746883/746904 co-relation queries the response was YES. [2024-06-28 00:20:09,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71154 conditions, 6901 events. 4456/6901 cut-off events. For 746883/746904 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 40076 event pairs, 946 based on Foata normal form. 30/6926 useless extension candidates. Maximal degree in co-relation 71014. Up to 6489 conditions per place. [2024-06-28 00:20:09,204 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 339 selfloop transitions, 72 changer transitions 0/414 dead transitions. [2024-06-28 00:20:09,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 414 transitions, 7937 flow [2024-06-28 00:20:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:20:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:20:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-06-28 00:20:09,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36428571428571427 [2024-06-28 00:20:09,207 INFO L175 Difference]: Start difference. First operand has 279 places, 376 transitions, 6925 flow. Second operand 10 states and 153 transitions. [2024-06-28 00:20:09,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 414 transitions, 7937 flow [2024-06-28 00:20:10,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 414 transitions, 7729 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-28 00:20:10,350 INFO L231 Difference]: Finished difference. Result has 281 places, 377 transitions, 6928 flow [2024-06-28 00:20:10,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6717, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6928, PETRI_PLACES=281, PETRI_TRANSITIONS=377} [2024-06-28 00:20:10,351 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places. [2024-06-28 00:20:10,351 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 377 transitions, 6928 flow [2024-06-28 00:20:10,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:10,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:10,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-28 00:20:10,352 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:10,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 937511724, now seen corresponding path program 2 times [2024-06-28 00:20:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:10,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678082027] [2024-06-28 00:20:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:18,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:18,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678082027] [2024-06-28 00:20:18,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678082027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:18,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:18,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:20:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287502868] [2024-06-28 00:20:18,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:18,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:20:18,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:18,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:20:18,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:20:18,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:20:18,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 377 transitions, 6928 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:18,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:18,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:20:18,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:21,289 INFO L124 PetriNetUnfolderBase]: 4496/6972 cut-off events. [2024-06-28 00:20:21,290 INFO L125 PetriNetUnfolderBase]: For 763803/763824 co-relation queries the response was YES. [2024-06-28 00:20:21,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71305 conditions, 6972 events. 4496/6972 cut-off events. For 763803/763824 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 40583 event pairs, 977 based on Foata normal form. 34/7001 useless extension candidates. Maximal degree in co-relation 71164. Up to 6287 conditions per place. [2024-06-28 00:20:21,388 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 334 selfloop transitions, 86 changer transitions 0/423 dead transitions. [2024-06-28 00:20:21,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 423 transitions, 7997 flow [2024-06-28 00:20:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:20:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:20:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-06-28 00:20:21,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36706349206349204 [2024-06-28 00:20:21,391 INFO L175 Difference]: Start difference. First operand has 281 places, 377 transitions, 6928 flow. Second operand 12 states and 185 transitions. [2024-06-28 00:20:21,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 423 transitions, 7997 flow [2024-06-28 00:20:22,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 423 transitions, 7814 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-28 00:20:22,738 INFO L231 Difference]: Finished difference. Result has 285 places, 378 transitions, 6985 flow [2024-06-28 00:20:22,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6745, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6985, PETRI_PLACES=285, PETRI_TRANSITIONS=378} [2024-06-28 00:20:22,739 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 242 predicate places. [2024-06-28 00:20:22,739 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 378 transitions, 6985 flow [2024-06-28 00:20:22,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:22,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:22,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:22,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-28 00:20:22,740 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:22,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash 766516344, now seen corresponding path program 3 times [2024-06-28 00:20:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326151683] [2024-06-28 00:20:22,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326151683] [2024-06-28 00:20:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326151683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:20:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915435136] [2024-06-28 00:20:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:33,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:20:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:33,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:20:33,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:20:33,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:20:33,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 378 transitions, 6985 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:33,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:33,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:20:33,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:36,435 INFO L124 PetriNetUnfolderBase]: 4544/7056 cut-off events. [2024-06-28 00:20:36,436 INFO L125 PetriNetUnfolderBase]: For 745832/745853 co-relation queries the response was YES. [2024-06-28 00:20:36,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71234 conditions, 7056 events. 4544/7056 cut-off events. For 745832/745853 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 41314 event pairs, 879 based on Foata normal form. 30/7081 useless extension candidates. Maximal degree in co-relation 71092. Up to 5332 conditions per place. [2024-06-28 00:20:36,520 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 256 selfloop transitions, 167 changer transitions 0/426 dead transitions. [2024-06-28 00:20:36,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 426 transitions, 8198 flow [2024-06-28 00:20:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:20:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:20:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-28 00:20:36,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 00:20:36,523 INFO L175 Difference]: Start difference. First operand has 285 places, 378 transitions, 6985 flow. Second operand 9 states and 162 transitions. [2024-06-28 00:20:36,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 426 transitions, 8198 flow [2024-06-28 00:20:37,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 426 transitions, 8013 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-28 00:20:37,526 INFO L231 Difference]: Finished difference. Result has 285 places, 379 transitions, 7199 flow [2024-06-28 00:20:37,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6800, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7199, PETRI_PLACES=285, PETRI_TRANSITIONS=379} [2024-06-28 00:20:37,527 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 242 predicate places. [2024-06-28 00:20:37,527 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 379 transitions, 7199 flow [2024-06-28 00:20:37,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:37,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:37,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:37,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-28 00:20:37,527 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:37,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1619410598, now seen corresponding path program 4 times [2024-06-28 00:20:37,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:37,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868074617] [2024-06-28 00:20:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868074617] [2024-06-28 00:20:46,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868074617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:46,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:46,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:20:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896649308] [2024-06-28 00:20:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:46,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:20:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:20:46,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:20:46,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:20:46,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 379 transitions, 7199 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:46,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:46,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:20:46,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:49,249 INFO L124 PetriNetUnfolderBase]: 4592/7139 cut-off events. [2024-06-28 00:20:49,249 INFO L125 PetriNetUnfolderBase]: For 776240/776261 co-relation queries the response was YES. [2024-06-28 00:20:49,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72915 conditions, 7139 events. 4592/7139 cut-off events. For 776240/776261 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 42098 event pairs, 985 based on Foata normal form. 30/7164 useless extension candidates. Maximal degree in co-relation 72771. Up to 6705 conditions per place. [2024-06-28 00:20:49,352 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 347 selfloop transitions, 73 changer transitions 0/423 dead transitions. [2024-06-28 00:20:49,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 423 transitions, 8383 flow [2024-06-28 00:20:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:20:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:20:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-28 00:20:49,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2024-06-28 00:20:49,355 INFO L175 Difference]: Start difference. First operand has 285 places, 379 transitions, 7199 flow. Second operand 10 states and 159 transitions. [2024-06-28 00:20:49,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 423 transitions, 8383 flow [2024-06-28 00:20:50,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 423 transitions, 8030 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-28 00:20:50,556 INFO L231 Difference]: Finished difference. Result has 288 places, 380 transitions, 7062 flow [2024-06-28 00:20:50,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6848, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7062, PETRI_PLACES=288, PETRI_TRANSITIONS=380} [2024-06-28 00:20:50,557 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 245 predicate places. [2024-06-28 00:20:50,557 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 380 transitions, 7062 flow [2024-06-28 00:20:50,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:50,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:20:50,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:20:50,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-28 00:20:50,558 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:20:50,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:20:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1246868030, now seen corresponding path program 1 times [2024-06-28 00:20:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:20:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486443678] [2024-06-28 00:20:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:20:50,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:20:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:20:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:20:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:20:56,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486443678] [2024-06-28 00:20:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486443678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:20:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:20:56,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:20:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009141016] [2024-06-28 00:20:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:20:56,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:20:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:20:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:20:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:20:56,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:20:56,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 380 transitions, 7062 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:20:56,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:20:56,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:20:56,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:20:59,893 INFO L124 PetriNetUnfolderBase]: 4696/7288 cut-off events. [2024-06-28 00:20:59,893 INFO L125 PetriNetUnfolderBase]: For 785011/785035 co-relation queries the response was YES. [2024-06-28 00:20:59,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73894 conditions, 7288 events. 4696/7288 cut-off events. For 785011/785035 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 42989 event pairs, 1034 based on Foata normal form. 26/7303 useless extension candidates. Maximal degree in co-relation 73750. Up to 6578 conditions per place. [2024-06-28 00:20:59,989 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 317 selfloop transitions, 101 changer transitions 0/421 dead transitions. [2024-06-28 00:20:59,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 421 transitions, 8666 flow [2024-06-28 00:20:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:20:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:20:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-28 00:20:59,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 00:20:59,991 INFO L175 Difference]: Start difference. First operand has 288 places, 380 transitions, 7062 flow. Second operand 7 states and 126 transitions. [2024-06-28 00:20:59,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 421 transitions, 8666 flow [2024-06-28 00:21:01,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 421 transitions, 8462 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-28 00:21:01,111 INFO L231 Difference]: Finished difference. Result has 290 places, 392 transitions, 7465 flow [2024-06-28 00:21:01,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6858, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7465, PETRI_PLACES=290, PETRI_TRANSITIONS=392} [2024-06-28 00:21:01,111 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 247 predicate places. [2024-06-28 00:21:01,111 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 392 transitions, 7465 flow [2024-06-28 00:21:01,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:01,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:01,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:01,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-28 00:21:01,112 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:01,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1083181652, now seen corresponding path program 2 times [2024-06-28 00:21:01,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:01,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941871075] [2024-06-28 00:21:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:01,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:06,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941871075] [2024-06-28 00:21:06,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941871075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:06,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:06,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:21:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518883107] [2024-06-28 00:21:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:06,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:21:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:21:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:21:06,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:21:06,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 392 transitions, 7465 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:06,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:06,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:21:06,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:09,774 INFO L124 PetriNetUnfolderBase]: 4701/7289 cut-off events. [2024-06-28 00:21:09,774 INFO L125 PetriNetUnfolderBase]: For 789434/789443 co-relation queries the response was YES. [2024-06-28 00:21:09,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75407 conditions, 7289 events. 4701/7289 cut-off events. For 789434/789443 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 42873 event pairs, 1015 based on Foata normal form. 9/7295 useless extension candidates. Maximal degree in co-relation 75259. Up to 7216 conditions per place. [2024-06-28 00:21:09,874 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 376 selfloop transitions, 32 changer transitions 0/411 dead transitions. [2024-06-28 00:21:09,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 411 transitions, 8409 flow [2024-06-28 00:21:09,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:21:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:21:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-28 00:21:09,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36394557823129253 [2024-06-28 00:21:09,888 INFO L175 Difference]: Start difference. First operand has 290 places, 392 transitions, 7465 flow. Second operand 7 states and 107 transitions. [2024-06-28 00:21:09,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 411 transitions, 8409 flow [2024-06-28 00:21:11,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 411 transitions, 8308 flow, removed 36 selfloop flow, removed 2 redundant places. [2024-06-28 00:21:11,345 INFO L231 Difference]: Finished difference. Result has 295 places, 395 transitions, 7525 flow [2024-06-28 00:21:11,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7364, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7525, PETRI_PLACES=295, PETRI_TRANSITIONS=395} [2024-06-28 00:21:11,347 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 252 predicate places. [2024-06-28 00:21:11,347 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 395 transitions, 7525 flow [2024-06-28 00:21:11,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:11,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:11,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:11,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-28 00:21:11,348 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:11,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash 558734072, now seen corresponding path program 5 times [2024-06-28 00:21:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794418343] [2024-06-28 00:21:11,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:11,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:19,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:19,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794418343] [2024-06-28 00:21:19,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794418343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:19,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:19,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:19,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810946897] [2024-06-28 00:21:19,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:19,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:19,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:19,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:19,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:21:19,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 395 transitions, 7525 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:19,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:19,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:21:19,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:22,954 INFO L124 PetriNetUnfolderBase]: 4749/7375 cut-off events. [2024-06-28 00:21:22,954 INFO L125 PetriNetUnfolderBase]: For 831629/831648 co-relation queries the response was YES. [2024-06-28 00:21:23,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75728 conditions, 7375 events. 4749/7375 cut-off events. For 831629/831648 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 43609 event pairs, 1007 based on Foata normal form. 28/7398 useless extension candidates. Maximal degree in co-relation 75578. Up to 6995 conditions per place. [2024-06-28 00:21:23,056 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 374 selfloop transitions, 57 changer transitions 0/434 dead transitions. [2024-06-28 00:21:23,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 434 transitions, 8587 flow [2024-06-28 00:21:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:21:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:21:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-28 00:21:23,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-28 00:21:23,059 INFO L175 Difference]: Start difference. First operand has 295 places, 395 transitions, 7525 flow. Second operand 8 states and 138 transitions. [2024-06-28 00:21:23,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 434 transitions, 8587 flow [2024-06-28 00:21:24,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 434 transitions, 8494 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-28 00:21:24,799 INFO L231 Difference]: Finished difference. Result has 299 places, 396 transitions, 7616 flow [2024-06-28 00:21:24,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7432, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7616, PETRI_PLACES=299, PETRI_TRANSITIONS=396} [2024-06-28 00:21:24,799 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 256 predicate places. [2024-06-28 00:21:24,799 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 396 transitions, 7616 flow [2024-06-28 00:21:24,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:24,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:24,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:24,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-28 00:21:24,800 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:24,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1553244034, now seen corresponding path program 6 times [2024-06-28 00:21:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667166179] [2024-06-28 00:21:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:33,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-28 00:21:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667166179] [2024-06-28 00:21:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667166179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447519938] [2024-06-28 00:21:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:33,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:21:33,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:21:33,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 396 transitions, 7616 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:33,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:33,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:21:33,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:36,463 INFO L124 PetriNetUnfolderBase]: 4797/7459 cut-off events. [2024-06-28 00:21:36,463 INFO L125 PetriNetUnfolderBase]: For 858318/858337 co-relation queries the response was YES. [2024-06-28 00:21:36,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76798 conditions, 7459 events. 4797/7459 cut-off events. For 858318/858337 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 44323 event pairs, 1031 based on Foata normal form. 28/7482 useless extension candidates. Maximal degree in co-relation 76648. Up to 7066 conditions per place. [2024-06-28 00:21:36,554 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 366 selfloop transitions, 65 changer transitions 0/434 dead transitions. [2024-06-28 00:21:36,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 434 transitions, 8678 flow [2024-06-28 00:21:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:21:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:21:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2024-06-28 00:21:36,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-28 00:21:36,557 INFO L175 Difference]: Start difference. First operand has 299 places, 396 transitions, 7616 flow. Second operand 10 states and 154 transitions. [2024-06-28 00:21:36,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 434 transitions, 8678 flow [2024-06-28 00:21:37,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 434 transitions, 8520 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-28 00:21:37,887 INFO L231 Difference]: Finished difference. Result has 304 places, 397 transitions, 7660 flow [2024-06-28 00:21:37,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7458, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7660, PETRI_PLACES=304, PETRI_TRANSITIONS=397} [2024-06-28 00:21:37,888 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 261 predicate places. [2024-06-28 00:21:37,888 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 397 transitions, 7660 flow [2024-06-28 00:21:37,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:37,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:37,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:37,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-28 00:21:37,889 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:37,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1838574544, now seen corresponding path program 7 times [2024-06-28 00:21:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443517096] [2024-06-28 00:21:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:47,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:47,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443517096] [2024-06-28 00:21:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443517096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:47,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:47,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 00:21:47,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315968350] [2024-06-28 00:21:47,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:47,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 00:21:47,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:47,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 00:21:47,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 00:21:47,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:21:47,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 397 transitions, 7660 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:47,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:21:47,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:21:47,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:21:50,442 INFO L124 PetriNetUnfolderBase]: 4845/7543 cut-off events. [2024-06-28 00:21:50,443 INFO L125 PetriNetUnfolderBase]: For 880984/881003 co-relation queries the response was YES. [2024-06-28 00:21:50,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77585 conditions, 7543 events. 4845/7543 cut-off events. For 880984/881003 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 44980 event pairs, 938 based on Foata normal form. 28/7566 useless extension candidates. Maximal degree in co-relation 77433. Up to 7083 conditions per place. [2024-06-28 00:21:50,532 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 375 selfloop transitions, 59 changer transitions 0/437 dead transitions. [2024-06-28 00:21:50,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 437 transitions, 8730 flow [2024-06-28 00:21:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:21:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:21:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-28 00:21:50,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3595238095238095 [2024-06-28 00:21:50,534 INFO L175 Difference]: Start difference. First operand has 304 places, 397 transitions, 7660 flow. Second operand 10 states and 151 transitions. [2024-06-28 00:21:50,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 437 transitions, 8730 flow [2024-06-28 00:21:51,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 437 transitions, 8551 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-28 00:21:51,798 INFO L231 Difference]: Finished difference. Result has 306 places, 398 transitions, 7673 flow [2024-06-28 00:21:51,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7481, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7673, PETRI_PLACES=306, PETRI_TRANSITIONS=398} [2024-06-28 00:21:51,799 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 263 predicate places. [2024-06-28 00:21:51,799 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 398 transitions, 7673 flow [2024-06-28 00:21:51,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:21:51,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:21:51,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:21:51,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-28 00:21:51,800 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:21:51,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:21:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2109560590, now seen corresponding path program 8 times [2024-06-28 00:21:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:21:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980462001] [2024-06-28 00:21:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:21:51,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:21:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:21:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:21:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:21:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980462001] [2024-06-28 00:21:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980462001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:21:59,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:21:59,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:21:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273170847] [2024-06-28 00:21:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:21:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:21:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:21:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:21:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:22:00,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:22:00,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 398 transitions, 7673 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:00,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:00,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:22:00,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:03,538 INFO L124 PetriNetUnfolderBase]: 4825/7511 cut-off events. [2024-06-28 00:22:03,538 INFO L125 PetriNetUnfolderBase]: For 870299/870318 co-relation queries the response was YES. [2024-06-28 00:22:03,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76485 conditions, 7511 events. 4825/7511 cut-off events. For 870299/870318 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 44812 event pairs, 1015 based on Foata normal form. 28/7534 useless extension candidates. Maximal degree in co-relation 76332. Up to 7001 conditions per place. [2024-06-28 00:22:03,641 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 366 selfloop transitions, 71 changer transitions 0/440 dead transitions. [2024-06-28 00:22:03,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 440 transitions, 8699 flow [2024-06-28 00:22:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:22:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:22:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-28 00:22:03,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-28 00:22:03,644 INFO L175 Difference]: Start difference. First operand has 306 places, 398 transitions, 7673 flow. Second operand 11 states and 168 transitions. [2024-06-28 00:22:03,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 440 transitions, 8699 flow [2024-06-28 00:22:05,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 440 transitions, 8533 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-28 00:22:05,180 INFO L231 Difference]: Finished difference. Result has 309 places, 398 transitions, 7657 flow [2024-06-28 00:22:05,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7507, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7657, PETRI_PLACES=309, PETRI_TRANSITIONS=398} [2024-06-28 00:22:05,180 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 266 predicate places. [2024-06-28 00:22:05,180 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 398 transitions, 7657 flow [2024-06-28 00:22:05,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:05,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:05,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:05,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-28 00:22:05,181 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:05,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2109567286, now seen corresponding path program 4 times [2024-06-28 00:22:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385887431] [2024-06-28 00:22:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:12,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385887431] [2024-06-28 00:22:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385887431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:22:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858544993] [2024-06-28 00:22:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:12,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:22:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:22:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:22:12,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:22:12,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 398 transitions, 7657 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:13,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:13,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:22:13,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:15,798 INFO L124 PetriNetUnfolderBase]: 4797/7467 cut-off events. [2024-06-28 00:22:15,799 INFO L125 PetriNetUnfolderBase]: For 858731/858750 co-relation queries the response was YES. [2024-06-28 00:22:15,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75133 conditions, 7467 events. 4797/7467 cut-off events. For 858731/858750 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 44572 event pairs, 919 based on Foata normal form. 32/7494 useless extension candidates. Maximal degree in co-relation 74979. Up to 6465 conditions per place. [2024-06-28 00:22:15,910 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 299 selfloop transitions, 144 changer transitions 0/446 dead transitions. [2024-06-28 00:22:15,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 446 transitions, 8927 flow [2024-06-28 00:22:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-28 00:22:15,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-28 00:22:15,912 INFO L175 Difference]: Start difference. First operand has 309 places, 398 transitions, 7657 flow. Second operand 8 states and 161 transitions. [2024-06-28 00:22:15,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 446 transitions, 8927 flow [2024-06-28 00:22:17,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 446 transitions, 8628 flow, removed 30 selfloop flow, removed 11 redundant places. [2024-06-28 00:22:17,644 INFO L231 Difference]: Finished difference. Result has 306 places, 399 transitions, 7669 flow [2024-06-28 00:22:17,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7226, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7669, PETRI_PLACES=306, PETRI_TRANSITIONS=399} [2024-06-28 00:22:17,645 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 263 predicate places. [2024-06-28 00:22:17,647 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 399 transitions, 7669 flow [2024-06-28 00:22:17,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:17,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:17,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:17,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-28 00:22:17,647 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:17,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash 983478634, now seen corresponding path program 3 times [2024-06-28 00:22:17,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:17,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701323761] [2024-06-28 00:22:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:17,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701323761] [2024-06-28 00:22:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701323761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:22:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025293875] [2024-06-28 00:22:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:23,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:22:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:22:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:22:23,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:22:23,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 399 transitions, 7669 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:23,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:23,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:22:23,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:26,151 INFO L124 PetriNetUnfolderBase]: 4799/7472 cut-off events. [2024-06-28 00:22:26,151 INFO L125 PetriNetUnfolderBase]: For 825710/825710 co-relation queries the response was YES. [2024-06-28 00:22:26,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75565 conditions, 7472 events. 4799/7472 cut-off events. For 825710/825710 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 44564 event pairs, 1074 based on Foata normal form. 2/7472 useless extension candidates. Maximal degree in co-relation 75412. Up to 7426 conditions per place. [2024-06-28 00:22:26,249 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 392 selfloop transitions, 24 changer transitions 0/419 dead transitions. [2024-06-28 00:22:26,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 419 transitions, 8695 flow [2024-06-28 00:22:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-28 00:22:26,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-28 00:22:26,251 INFO L175 Difference]: Start difference. First operand has 306 places, 399 transitions, 7669 flow. Second operand 8 states and 105 transitions. [2024-06-28 00:22:26,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 419 transitions, 8695 flow [2024-06-28 00:22:27,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 419 transitions, 8509 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-28 00:22:27,743 INFO L231 Difference]: Finished difference. Result has 308 places, 408 transitions, 7735 flow [2024-06-28 00:22:27,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7483, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7735, PETRI_PLACES=308, PETRI_TRANSITIONS=408} [2024-06-28 00:22:27,744 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 265 predicate places. [2024-06-28 00:22:27,744 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 408 transitions, 7735 flow [2024-06-28 00:22:27,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:27,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:27,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:27,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-28 00:22:27,744 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:27,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 983479006, now seen corresponding path program 2 times [2024-06-28 00:22:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:27,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975160803] [2024-06-28 00:22:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975160803] [2024-06-28 00:22:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975160803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:33,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:22:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245452825] [2024-06-28 00:22:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:33,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:22:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:33,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:22:33,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:22:33,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:22:33,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 408 transitions, 7735 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:33,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:33,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:22:33,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:37,125 INFO L124 PetriNetUnfolderBase]: 4947/7679 cut-off events. [2024-06-28 00:22:37,126 INFO L125 PetriNetUnfolderBase]: For 860212/860215 co-relation queries the response was YES. [2024-06-28 00:22:37,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78260 conditions, 7679 events. 4947/7679 cut-off events. For 860212/860215 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 45805 event pairs, 1065 based on Foata normal form. 10/7686 useless extension candidates. Maximal degree in co-relation 78103. Up to 7319 conditions per place. [2024-06-28 00:22:37,221 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 392 selfloop transitions, 52 changer transitions 0/447 dead transitions. [2024-06-28 00:22:37,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 447 transitions, 9468 flow [2024-06-28 00:22:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:22:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:22:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2024-06-28 00:22:37,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34656084656084657 [2024-06-28 00:22:37,222 INFO L175 Difference]: Start difference. First operand has 308 places, 408 transitions, 7735 flow. Second operand 9 states and 131 transitions. [2024-06-28 00:22:37,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 447 transitions, 9468 flow [2024-06-28 00:22:38,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 447 transitions, 9404 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-28 00:22:38,888 INFO L231 Difference]: Finished difference. Result has 316 places, 423 transitions, 8234 flow [2024-06-28 00:22:38,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7671, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8234, PETRI_PLACES=316, PETRI_TRANSITIONS=423} [2024-06-28 00:22:38,888 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 273 predicate places. [2024-06-28 00:22:38,889 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 423 transitions, 8234 flow [2024-06-28 00:22:38,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:38,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:38,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:38,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-28 00:22:38,889 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:38,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1022411604, now seen corresponding path program 4 times [2024-06-28 00:22:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:38,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682142932] [2024-06-28 00:22:38,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:38,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:43,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682142932] [2024-06-28 00:22:43,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682142932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:43,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:43,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:22:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598315979] [2024-06-28 00:22:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:43,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:22:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:22:43,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:22:44,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:22:44,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 423 transitions, 8234 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:44,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:44,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:22:44,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:46,968 INFO L124 PetriNetUnfolderBase]: 4981/7727 cut-off events. [2024-06-28 00:22:46,968 INFO L125 PetriNetUnfolderBase]: For 865159/865167 co-relation queries the response was YES. [2024-06-28 00:22:47,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79948 conditions, 7727 events. 4981/7727 cut-off events. For 865159/865167 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 46042 event pairs, 1080 based on Foata normal form. 9/7734 useless extension candidates. Maximal degree in co-relation 79788. Up to 7583 conditions per place. [2024-06-28 00:22:47,100 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 413 selfloop transitions, 59 changer transitions 0/475 dead transitions. [2024-06-28 00:22:47,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 475 transitions, 9867 flow [2024-06-28 00:22:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-28 00:22:47,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3898809523809524 [2024-06-28 00:22:47,103 INFO L175 Difference]: Start difference. First operand has 316 places, 423 transitions, 8234 flow. Second operand 8 states and 131 transitions. [2024-06-28 00:22:47,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 475 transitions, 9867 flow [2024-06-28 00:22:49,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 475 transitions, 9750 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-28 00:22:49,101 INFO L231 Difference]: Finished difference. Result has 322 places, 443 transitions, 8753 flow [2024-06-28 00:22:49,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8117, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8753, PETRI_PLACES=322, PETRI_TRANSITIONS=443} [2024-06-28 00:22:49,102 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2024-06-28 00:22:49,102 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 443 transitions, 8753 flow [2024-06-28 00:22:49,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:49,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:49,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:49,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-28 00:22:49,102 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:49,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 391855754, now seen corresponding path program 5 times [2024-06-28 00:22:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533080173] [2024-06-28 00:22:49,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:22:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:22:54,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:22:54,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533080173] [2024-06-28 00:22:54,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533080173] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:22:54,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:22:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:22:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666824146] [2024-06-28 00:22:54,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:22:54,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:22:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:22:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:22:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:22:54,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:22:54,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 443 transitions, 8753 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:54,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:22:54,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:22:54,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:22:57,371 INFO L124 PetriNetUnfolderBase]: 5011/7771 cut-off events. [2024-06-28 00:22:57,371 INFO L125 PetriNetUnfolderBase]: For 884834/884846 co-relation queries the response was YES. [2024-06-28 00:22:57,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81458 conditions, 7771 events. 5011/7771 cut-off events. For 884834/884846 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 46281 event pairs, 1082 based on Foata normal form. 13/7782 useless extension candidates. Maximal degree in co-relation 81294. Up to 7658 conditions per place. [2024-06-28 00:22:57,485 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 435 selfloop transitions, 53 changer transitions 0/491 dead transitions. [2024-06-28 00:22:57,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 491 transitions, 10423 flow [2024-06-28 00:22:57,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:22:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:22:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-28 00:22:57,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3869047619047619 [2024-06-28 00:22:57,488 INFO L175 Difference]: Start difference. First operand has 322 places, 443 transitions, 8753 flow. Second operand 8 states and 130 transitions. [2024-06-28 00:22:57,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 491 transitions, 10423 flow [2024-06-28 00:22:59,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 491 transitions, 10303 flow, removed 59 selfloop flow, removed 1 redundant places. [2024-06-28 00:22:59,794 INFO L231 Difference]: Finished difference. Result has 330 places, 460 transitions, 9256 flow [2024-06-28 00:22:59,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8689, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9256, PETRI_PLACES=330, PETRI_TRANSITIONS=460} [2024-06-28 00:22:59,795 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 287 predicate places. [2024-06-28 00:22:59,795 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 460 transitions, 9256 flow [2024-06-28 00:22:59,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:22:59,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:22:59,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:22:59,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-28 00:22:59,796 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:22:59,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:22:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 435543806, now seen corresponding path program 3 times [2024-06-28 00:22:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:22:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129200090] [2024-06-28 00:22:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:22:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:22:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:05,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:05,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129200090] [2024-06-28 00:23:05,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129200090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:05,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:05,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:23:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910640762] [2024-06-28 00:23:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:05,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:23:05,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:05,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:23:05,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:23:05,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:23:05,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 460 transitions, 9256 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:05,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:05,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:23:05,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:08,789 INFO L124 PetriNetUnfolderBase]: 5039/7817 cut-off events. [2024-06-28 00:23:08,789 INFO L125 PetriNetUnfolderBase]: For 909157/909177 co-relation queries the response was YES. [2024-06-28 00:23:08,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81956 conditions, 7817 events. 5039/7817 cut-off events. For 909157/909177 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 46738 event pairs, 1071 based on Foata normal form. 22/7830 useless extension candidates. Maximal degree in co-relation 81788. Up to 6978 conditions per place. [2024-06-28 00:23:08,896 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 374 selfloop transitions, 126 changer transitions 0/503 dead transitions. [2024-06-28 00:23:08,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 503 transitions, 10960 flow [2024-06-28 00:23:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:23:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:23:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 00:23:08,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-28 00:23:08,898 INFO L175 Difference]: Start difference. First operand has 330 places, 460 transitions, 9256 flow. Second operand 8 states and 144 transitions. [2024-06-28 00:23:08,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 503 transitions, 10960 flow [2024-06-28 00:23:11,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 503 transitions, 10846 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-28 00:23:11,134 INFO L231 Difference]: Finished difference. Result has 335 places, 467 transitions, 9572 flow [2024-06-28 00:23:11,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9142, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9572, PETRI_PLACES=335, PETRI_TRANSITIONS=467} [2024-06-28 00:23:11,135 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 292 predicate places. [2024-06-28 00:23:11,135 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 467 transitions, 9572 flow [2024-06-28 00:23:11,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:11,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:23:11,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:23:11,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-28 00:23:11,135 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-28 00:23:11,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:23:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash 392154284, now seen corresponding path program 6 times [2024-06-28 00:23:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:23:11,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574472961] [2024-06-28 00:23:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:23:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:23:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:23:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:23:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:23:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574472961] [2024-06-28 00:23:16,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574472961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:23:16,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:23:16,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:23:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922774075] [2024-06-28 00:23:16,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:23:16,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:23:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:23:16,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:23:16,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:23:16,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-06-28 00:23:16,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 467 transitions, 9572 flow. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:23:16,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:23:16,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-06-28 00:23:16,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:23:19,573 INFO L124 PetriNetUnfolderBase]: 5036/7807 cut-off events. [2024-06-28 00:23:19,573 INFO L125 PetriNetUnfolderBase]: For 918541/918553 co-relation queries the response was YES. [2024-06-28 00:23:19,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82750 conditions, 7807 events. 5036/7807 cut-off events. For 918541/918553 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 46532 event pairs, 1085 based on Foata normal form. 13/7818 useless extension candidates. Maximal degree in co-relation 82580. Up to 7729 conditions per place. [2024-06-28 00:23:19,675 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 451 selfloop transitions, 37 changer transitions 0/491 dead transitions. [2024-06-28 00:23:19,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 491 transitions, 10620 flow [2024-06-28 00:23:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:23:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:23:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 00:23:19,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3601190476190476 [2024-06-28 00:23:19,678 INFO L175 Difference]: Start difference. First operand has 335 places, 467 transitions, 9572 flow. Second operand 8 states and 121 transitions. [2024-06-28 00:23:19,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 491 transitions, 10620 flow Killed by 15