./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 --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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:38:12,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:38:12,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:38:12,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:38:12,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:38:12,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:38:12,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:38:12,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:38:12,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:38:12,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:38:12,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:38:12,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:38:12,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:38:12,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:38:12,327 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:38:12,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:38:12,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:38:12,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:38:12,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:38:12,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:38:12,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:38:12,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:38:12,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:38:12,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:38:12,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:38:12,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:38:12,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:38:12,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:38:12,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:38:12,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:38:12,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:38:12,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:38:12,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:38:12,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:38:12,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:38:12,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:38:12,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:38:12,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:38:12,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:38:12,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:38:12,335 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:38:12,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:38:12,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:38:12,335 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:38:12,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:38:12,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:38:12,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:38:12,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:38:12,620 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:38:12,621 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-27 22:38:13,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:38:13,780 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:38:13,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i [2024-06-27 22:38:13,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa901d81/1933d76d3adc40b9852616e3feb0db31/FLAGdbdcfc311 [2024-06-27 22:38:14,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa901d81/1933d76d3adc40b9852616e3feb0db31 [2024-06-27 22:38:14,137 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:38:14,138 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:38:14,139 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-27 22:38:14,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:38:14,198 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:38:14,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:38:14,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:38:14,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:38:14,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:38:14" (1/2) ... [2024-06-27 22:38:14,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12080ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:38:14, skipping insertion in model container [2024-06-27 22:38:14,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:38:14" (1/2) ... [2024-06-27 22:38:14,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1adcba8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:38:14, skipping insertion in model container [2024-06-27 22:38:14,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:14" (2/2) ... [2024-06-27 22:38:14,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12080ad and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14, skipping insertion in model container [2024-06-27 22:38:14,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:14" (2/2) ... [2024-06-27 22:38:14,207 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:38:14,230 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:38:14,231 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-27 22:38:14,231 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-27 22:38:14,232 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-27 22:38:14,232 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:38:14,232 INFO L106 edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1; [2024-06-27 22:38:14,261 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:38:14,372 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i[951,964] [2024-06-27 22:38:14,571 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:38:14,584 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:38:14,613 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.opt.i[951,964] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:38:14,815 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:38:14,855 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:38:14,855 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14 WrapperNode [2024-06-27 22:38:14,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:38:14,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:38:14,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:38:14,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:38:14,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:14,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:14,983 INFO L138 Inliner]: procedures = 175, calls = 268, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 799 [2024-06-27 22:38:14,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:38:14,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:38:14,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:38:14,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:38:14,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:14,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,042 INFO L175 MemorySlicer]: Split 227 memory accesses to 2 slices as follows [2, 225]. 99 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2024-06-27 22:38:15,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:38:15,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:38:15,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:38:15,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:38:15,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (1/1) ... [2024-06-27 22:38:15,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:38:15,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:38:15,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:38:15,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:38:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 22:38:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 22:38:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 22:38:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 22:38:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:38:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:38:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:38:15,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:38:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:38:15,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:38:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:38:15,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:38:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:38:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 22:38:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:38:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:38:15,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:38:15,215 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:38:15,365 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:38:15,367 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:38:16,265 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:38:16,265 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:38:18,573 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:38:18,574 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:38:18,574 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:38:18 BoogieIcfgContainer [2024-06-27 22:38:18,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:38:18,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:38:18,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:38:18,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:38:18,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:38:14" (1/4) ... [2024-06-27 22:38:18,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533ca169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:38:18, skipping insertion in model container [2024-06-27 22:38:18,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:14" (2/4) ... [2024-06-27 22:38:18,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533ca169 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:38:18, skipping insertion in model container [2024-06-27 22:38:18,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:14" (3/4) ... [2024-06-27 22:38:18,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533ca169 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:38:18, skipping insertion in model container [2024-06-27 22:38:18,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:38:18" (4/4) ... [2024-06-27 22:38:18,585 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2024-06-27 22:38:18,600 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:38:18,600 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:38:18,600 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:38:18,665 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:38:18,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:38:18,737 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-06-27 22:38:18,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:38:18,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-06-27 22:38:18,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:38:18,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow [2024-06-27 22:38:18,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:38:18,764 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;@73332d04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:38:18,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:38:18,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:38:18,771 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:38:18,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:38:18,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:18,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:38:18,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:18,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1879916245, now seen corresponding path program 1 times [2024-06-27 22:38:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:18,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730683541] [2024-06-27 22:38:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:18,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:24,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:24,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730683541] [2024-06-27 22:38:24,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730683541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:24,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:24,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:38:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637148417] [2024-06-27 22:38:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:24,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:38:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:38:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:38:24,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:38:24,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:24,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:24,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:38:24,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:25,879 INFO L124 PetriNetUnfolderBase]: 4309/6243 cut-off events. [2024-06-27 22:38:25,880 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-06-27 22:38:25,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12579 conditions, 6243 events. 4309/6243 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 33350 event pairs, 2510 based on Foata normal form. 168/5911 useless extension candidates. Maximal degree in co-relation 12567. Up to 6197 conditions per place. [2024-06-27 22:38:25,914 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 51 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2024-06-27 22:38:25,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 253 flow [2024-06-27 22:38:25,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:38:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:38:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-06-27 22:38:25,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 22:38:25,925 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 96 transitions. [2024-06-27 22:38:25,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 253 flow [2024-06-27 22:38:25,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:38:25,930 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 124 flow [2024-06-27 22:38:25,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-27 22:38:25,934 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2024-06-27 22:38:25,934 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 124 flow [2024-06-27 22:38:25,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:25,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:25,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 22:38:25,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:38:25,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:25,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1852095031, now seen corresponding path program 1 times [2024-06-27 22:38:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:25,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223429500] [2024-06-27 22:38:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:25,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:25,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:25,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223429500] [2024-06-27 22:38:25,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223429500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:25,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:25,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:38:25,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629315968] [2024-06-27 22:38:25,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:25,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:38:25,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:25,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:38:25,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:38:25,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-06-27 22:38:25,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-27 22:38:25,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:25,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-06-27 22:38:25,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:26,930 INFO L124 PetriNetUnfolderBase]: 1689/2834 cut-off events. [2024-06-27 22:38:26,930 INFO L125 PetriNetUnfolderBase]: For 302/317 co-relation queries the response was YES. [2024-06-27 22:38:26,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5795 conditions, 2834 events. 1689/2834 cut-off events. For 302/317 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18815 event pairs, 472 based on Foata normal form. 4/2696 useless extension candidates. Maximal degree in co-relation 5783. Up to 1755 conditions per place. [2024-06-27 22:38:26,944 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 51 selfloop transitions, 2 changer transitions 1/70 dead transitions. [2024-06-27 22:38:26,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 290 flow [2024-06-27 22:38:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:38:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:38:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-06-27 22:38:26,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2024-06-27 22:38:26,946 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 124 flow. Second operand 3 states and 105 transitions. [2024-06-27 22:38:26,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 290 flow [2024-06-27 22:38:26,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:38:26,949 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 122 flow [2024-06-27 22:38:26,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-27 22:38:26,951 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2024-06-27 22:38:26,951 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 122 flow [2024-06-27 22:38:26,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-27 22:38:26,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:26,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:26,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:38:26,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:26,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:26,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1580370570, now seen corresponding path program 1 times [2024-06-27 22:38:26,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781127727] [2024-06-27 22:38:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781127727] [2024-06-27 22:38:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781127727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:31,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:31,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:38:31,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834251012] [2024-06-27 22:38:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:31,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:38:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:31,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:38:31,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:38:31,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-06-27 22:38:31,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:31,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:31,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-06-27 22:38:31,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:32,782 INFO L124 PetriNetUnfolderBase]: 5489/7858 cut-off events. [2024-06-27 22:38:32,782 INFO L125 PetriNetUnfolderBase]: For 1167/1167 co-relation queries the response was YES. [2024-06-27 22:38:32,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17573 conditions, 7858 events. 5489/7858 cut-off events. For 1167/1167 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 40951 event pairs, 2765 based on Foata normal form. 3/7858 useless extension candidates. Maximal degree in co-relation 17560. Up to 7801 conditions per place. [2024-06-27 22:38:32,818 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 67 selfloop transitions, 7 changer transitions 3/84 dead transitions. [2024-06-27 22:38:32,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 368 flow [2024-06-27 22:38:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:38:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:38:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-06-27 22:38:32,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.609375 [2024-06-27 22:38:32,824 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 122 flow. Second operand 4 states and 117 transitions. [2024-06-27 22:38:32,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 368 flow [2024-06-27 22:38:32,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:38:32,829 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 172 flow [2024-06-27 22:38:32,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-27 22:38:32,830 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2024-06-27 22:38:32,830 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 172 flow [2024-06-27 22:38:32,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:32,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:32,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:32,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:38:32,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:32,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:32,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1786544076, now seen corresponding path program 1 times [2024-06-27 22:38:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732643896] [2024-06-27 22:38:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:32,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732643896] [2024-06-27 22:38:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732643896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:36,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:38:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330196909] [2024-06-27 22:38:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:36,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:36,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:36,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-06-27 22:38:36,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:36,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:36,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-06-27 22:38:36,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:38,361 INFO L124 PetriNetUnfolderBase]: 4951/7749 cut-off events. [2024-06-27 22:38:38,361 INFO L125 PetriNetUnfolderBase]: For 2613/2613 co-relation queries the response was YES. [2024-06-27 22:38:38,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17596 conditions, 7749 events. 4951/7749 cut-off events. For 2613/2613 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 45612 event pairs, 2749 based on Foata normal form. 3/7534 useless extension candidates. Maximal degree in co-relation 17581. Up to 7031 conditions per place. [2024-06-27 22:38:38,401 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 82 selfloop transitions, 12 changer transitions 0/101 dead transitions. [2024-06-27 22:38:38,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 503 flow [2024-06-27 22:38:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:38:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:38:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-06-27 22:38:38,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-06-27 22:38:38,403 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 172 flow. Second operand 5 states and 138 transitions. [2024-06-27 22:38:38,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 503 flow [2024-06-27 22:38:38,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 499 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 22:38:38,406 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 287 flow [2024-06-27 22:38:38,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2024-06-27 22:38:38,407 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2024-06-27 22:38:38,407 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 287 flow [2024-06-27 22:38:38,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:38,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:38,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:38,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:38:38,408 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:38,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 451710771, now seen corresponding path program 1 times [2024-06-27 22:38:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:38,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602992123] [2024-06-27 22:38:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:42,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602992123] [2024-06-27 22:38:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602992123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:42,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:42,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:38:42,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141339468] [2024-06-27 22:38:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:42,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:38:42,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:42,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:38:42,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:38:42,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-06-27 22:38:42,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:42,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:42,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-06-27 22:38:42,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:44,130 INFO L124 PetriNetUnfolderBase]: 4945/7737 cut-off events. [2024-06-27 22:38:44,130 INFO L125 PetriNetUnfolderBase]: For 5422/5422 co-relation queries the response was YES. [2024-06-27 22:38:44,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19358 conditions, 7737 events. 4945/7737 cut-off events. For 5422/5422 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 45451 event pairs, 2347 based on Foata normal form. 3/7523 useless extension candidates. Maximal degree in co-relation 19338. Up to 6974 conditions per place. [2024-06-27 22:38:44,168 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 97 selfloop transitions, 22 changer transitions 0/126 dead transitions. [2024-06-27 22:38:44,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 126 transitions, 699 flow [2024-06-27 22:38:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-06-27 22:38:44,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-27 22:38:44,173 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 287 flow. Second operand 6 states and 170 transitions. [2024-06-27 22:38:44,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 126 transitions, 699 flow [2024-06-27 22:38:44,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 126 transitions, 683 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 22:38:44,178 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 376 flow [2024-06-27 22:38:44,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2024-06-27 22:38:44,179 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2024-06-27 22:38:44,179 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 376 flow [2024-06-27 22:38:44,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:44,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:44,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:44,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:38:44,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:44,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1118134323, now seen corresponding path program 1 times [2024-06-27 22:38:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067669631] [2024-06-27 22:38:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:48,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:48,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067669631] [2024-06-27 22:38:48,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067669631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:48,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:48,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:38:48,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342564871] [2024-06-27 22:38:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:48,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:38:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:48,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:38:48,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:38:48,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:38:48,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:48,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:48,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:38:48,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:50,629 INFO L124 PetriNetUnfolderBase]: 4957/7746 cut-off events. [2024-06-27 22:38:50,629 INFO L125 PetriNetUnfolderBase]: For 9055/9055 co-relation queries the response was YES. [2024-06-27 22:38:50,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21033 conditions, 7746 events. 4957/7746 cut-off events. For 9055/9055 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 45457 event pairs, 1901 based on Foata normal form. 6/7537 useless extension candidates. Maximal degree in co-relation 21009. Up to 6944 conditions per place. [2024-06-27 22:38:50,670 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 114 selfloop transitions, 18 changer transitions 0/138 dead transitions. [2024-06-27 22:38:50,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 138 transitions, 835 flow [2024-06-27 22:38:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:38:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:38:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 22:38:50,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:38:50,672 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 376 flow. Second operand 8 states and 192 transitions. [2024-06-27 22:38:50,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 138 transitions, 835 flow [2024-06-27 22:38:50,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 779 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-27 22:38:50,681 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 410 flow [2024-06-27 22:38:50,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2024-06-27 22:38:50,682 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2024-06-27 22:38:50,682 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 410 flow [2024-06-27 22:38:50,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:50,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:50,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:50,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:38:50,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:50,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1253644535, now seen corresponding path program 1 times [2024-06-27 22:38:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731436618] [2024-06-27 22:38:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:56,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-27 22:38:56,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:56,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731436618] [2024-06-27 22:38:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731436618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:56,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:38:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649650069] [2024-06-27 22:38:56,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:56,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:56,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:56,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:56,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:56,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2024-06-27 22:38:56,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:56,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:56,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2024-06-27 22:38:56,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:57,775 INFO L124 PetriNetUnfolderBase]: 3866/6217 cut-off events. [2024-06-27 22:38:57,775 INFO L125 PetriNetUnfolderBase]: For 8832/8894 co-relation queries the response was YES. [2024-06-27 22:38:57,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17022 conditions, 6217 events. 3866/6217 cut-off events. For 8832/8894 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 38088 event pairs, 1558 based on Foata normal form. 18/5857 useless extension candidates. Maximal degree in co-relation 16995. Up to 5433 conditions per place. [2024-06-27 22:38:57,805 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 73 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-06-27 22:38:57,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 104 transitions, 678 flow [2024-06-27 22:38:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:38:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:38:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-27 22:38:57,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:38:57,807 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 410 flow. Second operand 5 states and 125 transitions. [2024-06-27 22:38:57,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 104 transitions, 678 flow [2024-06-27 22:38:57,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 635 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:38:57,814 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 442 flow [2024-06-27 22:38:57,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2024-06-27 22:38:57,814 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2024-06-27 22:38:57,815 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 442 flow [2024-06-27 22:38:57,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:57,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:57,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:57,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:38:57,815 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:57,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:57,816 INFO L85 PathProgramCache]: Analyzing trace with hash -208271647, now seen corresponding path program 1 times [2024-06-27 22:38:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:57,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635674616] [2024-06-27 22:38:57,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:57,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:03,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635674616] [2024-06-27 22:39:03,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635674616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:03,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:03,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:39:03,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147331917] [2024-06-27 22:39:03,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:03,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:39:03,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:03,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:39:03,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:39:03,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:39:03,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:03,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:03,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:39:03,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:05,650 INFO L124 PetriNetUnfolderBase]: 5001/7652 cut-off events. [2024-06-27 22:39:05,650 INFO L125 PetriNetUnfolderBase]: For 13378/13393 co-relation queries the response was YES. [2024-06-27 22:39:05,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22712 conditions, 7652 events. 5001/7652 cut-off events. For 13378/13393 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43408 event pairs, 1794 based on Foata normal form. 20/7509 useless extension candidates. Maximal degree in co-relation 22683. Up to 6899 conditions per place. [2024-06-27 22:39:05,687 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 98 selfloop transitions, 24 changer transitions 0/128 dead transitions. [2024-06-27 22:39:05,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 128 transitions, 868 flow [2024-06-27 22:39:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:39:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:39:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-27 22:39:05,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:39:05,688 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 442 flow. Second operand 6 states and 147 transitions. [2024-06-27 22:39:05,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 128 transitions, 868 flow [2024-06-27 22:39:05,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 128 transitions, 842 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 22:39:05,696 INFO L231 Difference]: Finished difference. Result has 81 places, 88 transitions, 564 flow [2024-06-27 22:39:05,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=564, PETRI_PLACES=81, PETRI_TRANSITIONS=88} [2024-06-27 22:39:05,697 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2024-06-27 22:39:05,697 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 564 flow [2024-06-27 22:39:05,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:05,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:05,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:05,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:39:05,698 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:39:05,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:05,698 INFO L85 PathProgramCache]: Analyzing trace with hash -655642424, now seen corresponding path program 1 times [2024-06-27 22:39:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351472130] [2024-06-27 22:39:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:05,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:11,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:11,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351472130] [2024-06-27 22:39:11,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351472130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:11,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:11,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:39:11,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599610445] [2024-06-27 22:39:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:11,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:39:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:39:11,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:39:11,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:39:11,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:11,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:11,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:39:11,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:13,102 INFO L124 PetriNetUnfolderBase]: 5101/7823 cut-off events. [2024-06-27 22:39:13,102 INFO L125 PetriNetUnfolderBase]: For 18012/18012 co-relation queries the response was YES. [2024-06-27 22:39:13,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25436 conditions, 7823 events. 5101/7823 cut-off events. For 18012/18012 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 44355 event pairs, 1871 based on Foata normal form. 2/7651 useless extension candidates. Maximal degree in co-relation 25402. Up to 6964 conditions per place. [2024-06-27 22:39:13,145 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 107 selfloop transitions, 33 changer transitions 0/146 dead transitions. [2024-06-27 22:39:13,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 146 transitions, 1130 flow [2024-06-27 22:39:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:39:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:39:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-06-27 22:39:13,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 22:39:13,146 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 564 flow. Second operand 6 states and 152 transitions. [2024-06-27 22:39:13,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 146 transitions, 1130 flow [2024-06-27 22:39:13,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 146 transitions, 1114 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-27 22:39:13,162 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 782 flow [2024-06-27 22:39:13,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2024-06-27 22:39:13,162 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 35 predicate places. [2024-06-27 22:39:13,162 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 782 flow [2024-06-27 22:39:13,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:13,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:13,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:13,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:39:13,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:39:13,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1071460336, now seen corresponding path program 2 times [2024-06-27 22:39:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:13,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078719309] [2024-06-27 22:39:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:13,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:18,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:18,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078719309] [2024-06-27 22:39:18,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078719309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:18,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:18,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:39:18,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936367765] [2024-06-27 22:39:18,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:18,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:39:18,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:39:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:39:18,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:39:18,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 782 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:18,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:18,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:39:18,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:20,485 INFO L124 PetriNetUnfolderBase]: 5086/7785 cut-off events. [2024-06-27 22:39:20,485 INFO L125 PetriNetUnfolderBase]: For 20373/20394 co-relation queries the response was YES. [2024-06-27 22:39:20,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26102 conditions, 7785 events. 5086/7785 cut-off events. For 20373/20394 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 44067 event pairs, 1824 based on Foata normal form. 22/7639 useless extension candidates. Maximal degree in co-relation 26061. Up to 6953 conditions per place. [2024-06-27 22:39:20,524 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 100 selfloop transitions, 34 changer transitions 0/140 dead transitions. [2024-06-27 22:39:20,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 140 transitions, 1176 flow [2024-06-27 22:39:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:39:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:39:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-27 22:39:20,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:39:20,526 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 782 flow. Second operand 6 states and 147 transitions. [2024-06-27 22:39:20,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 140 transitions, 1176 flow [2024-06-27 22:39:20,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 140 transitions, 1136 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 22:39:20,551 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 822 flow [2024-06-27 22:39:20,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=822, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2024-06-27 22:39:20,552 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2024-06-27 22:39:20,552 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 822 flow [2024-06-27 22:39:20,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:20,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:20,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:20,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:39:20,553 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:39:20,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1817305322, now seen corresponding path program 3 times [2024-06-27 22:39:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:20,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406582381] [2024-06-27 22:39:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:20,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406582381] [2024-06-27 22:39:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406582381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:25,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:39:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305414625] [2024-06-27 22:39:25,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:25,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:39:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:25,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:39:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:39:25,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:39:25,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 822 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:25,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:25,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:39:25,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:28,266 INFO L124 PetriNetUnfolderBase]: 5129/8018 cut-off events. [2024-06-27 22:39:28,267 INFO L125 PetriNetUnfolderBase]: For 23859/23859 co-relation queries the response was YES. [2024-06-27 22:39:28,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26917 conditions, 8018 events. 5129/8018 cut-off events. For 23859/23859 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 47202 event pairs, 2094 based on Foata normal form. 2/7795 useless extension candidates. Maximal degree in co-relation 26873. Up to 7240 conditions per place. [2024-06-27 22:39:28,307 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 117 selfloop transitions, 34 changer transitions 0/157 dead transitions. [2024-06-27 22:39:28,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 157 transitions, 1365 flow [2024-06-27 22:39:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:39:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:39:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-27 22:39:28,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-27 22:39:28,309 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 822 flow. Second operand 8 states and 174 transitions. [2024-06-27 22:39:28,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 157 transitions, 1365 flow [2024-06-27 22:39:28,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 157 transitions, 1292 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 22:39:28,334 INFO L231 Difference]: Finished difference. Result has 100 places, 114 transitions, 1003 flow [2024-06-27 22:39:28,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1003, PETRI_PLACES=100, PETRI_TRANSITIONS=114} [2024-06-27 22:39:28,335 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 46 predicate places. [2024-06-27 22:39:28,335 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 114 transitions, 1003 flow [2024-06-27 22:39:28,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:28,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:28,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:28,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:39:28,336 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:39:28,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1507465510, now seen corresponding path program 1 times [2024-06-27 22:39:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25600695] [2024-06-27 22:39:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25600695] [2024-06-27 22:39:35,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25600695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:35,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:35,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337090968] [2024-06-27 22:39:35,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:35,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:35,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:35,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:35,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:39:35,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 114 transitions, 1003 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:35,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:35,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:39:35,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:37,540 INFO L124 PetriNetUnfolderBase]: 5208/8133 cut-off events. [2024-06-27 22:39:37,541 INFO L125 PetriNetUnfolderBase]: For 27185/27185 co-relation queries the response was YES. [2024-06-27 22:39:37,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27760 conditions, 8133 events. 5208/8133 cut-off events. For 27185/27185 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 47832 event pairs, 1935 based on Foata normal form. 2/7910 useless extension candidates. Maximal degree in co-relation 27712. Up to 7097 conditions per place. [2024-06-27 22:39:37,589 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 139 selfloop transitions, 48 changer transitions 0/193 dead transitions. [2024-06-27 22:39:37,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 193 transitions, 1830 flow [2024-06-27 22:39:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:39:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:39:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-06-27 22:39:37,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590277777777778 [2024-06-27 22:39:37,591 INFO L175 Difference]: Start difference. First operand has 100 places, 114 transitions, 1003 flow. Second operand 6 states and 161 transitions. [2024-06-27 22:39:37,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 193 transitions, 1830 flow [2024-06-27 22:39:37,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 193 transitions, 1758 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 22:39:37,621 INFO L231 Difference]: Finished difference. Result has 104 places, 147 transitions, 1434 flow [2024-06-27 22:39:37,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1434, PETRI_PLACES=104, PETRI_TRANSITIONS=147} [2024-06-27 22:39:37,622 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 50 predicate places. [2024-06-27 22:39:37,622 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 147 transitions, 1434 flow [2024-06-27 22:39:37,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:37,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:37,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:37,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:39:37,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:39:37,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash -349153600, now seen corresponding path program 2 times [2024-06-27 22:39:37,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:37,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537911202] [2024-06-27 22:39:37,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:42,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537911202] [2024-06-27 22:39:42,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537911202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:42,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342918377] [2024-06-27 22:39:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:42,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:42,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:42,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:42,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:39:42,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 147 transitions, 1434 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:42,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:42,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:39:42,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:45,241 INFO L124 PetriNetUnfolderBase]: 5239/8069 cut-off events. [2024-06-27 22:39:45,241 INFO L125 PetriNetUnfolderBase]: For 33952/33952 co-relation queries the response was YES. [2024-06-27 22:39:45,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30861 conditions, 8069 events. 5239/8069 cut-off events. For 33952/33952 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 46288 event pairs, 1822 based on Foata normal form. 2/7879 useless extension candidates. Maximal degree in co-relation 30809. Up to 7099 conditions per place. [2024-06-27 22:39:45,293 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 143 selfloop transitions, 72 changer transitions 0/221 dead transitions. [2024-06-27 22:39:45,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 221 transitions, 2145 flow [2024-06-27 22:39:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:39:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:39:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-06-27 22:39:45,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46458333333333335 [2024-06-27 22:39:45,294 INFO L175 Difference]: Start difference. First operand has 104 places, 147 transitions, 1434 flow. Second operand 10 states and 223 transitions. [2024-06-27 22:39:45,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 221 transitions, 2145 flow [2024-06-27 22:39:45,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 221 transitions, 2103 flow, removed 21 selfloop flow, removed 0 redundant places. [2024-06-27 22:39:45,336 INFO L231 Difference]: Finished difference. Result has 114 places, 155 transitions, 1642 flow [2024-06-27 22:39:45,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1642, PETRI_PLACES=114, PETRI_TRANSITIONS=155} [2024-06-27 22:39:45,337 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 60 predicate places. [2024-06-27 22:39:45,337 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 155 transitions, 1642 flow [2024-06-27 22:39:45,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:45,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:45,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:45,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:39:45,338 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:39:45,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1714238920, now seen corresponding path program 3 times [2024-06-27 22:39:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67396722] [2024-06-27 22:39:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67396722] [2024-06-27 22:39:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67396722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:50,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:50,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246600534] [2024-06-27 22:39:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:50,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:50,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:50,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:50,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:50,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:39:50,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 155 transitions, 1642 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:50,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:50,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:39:50,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:53,247 INFO L124 PetriNetUnfolderBase]: 5299/8253 cut-off events. [2024-06-27 22:39:53,247 INFO L125 PetriNetUnfolderBase]: For 41877/41892 co-relation queries the response was YES. [2024-06-27 22:39:53,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32848 conditions, 8253 events. 5299/8253 cut-off events. For 41877/41892 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 48324 event pairs, 1888 based on Foata normal form. 20/8047 useless extension candidates. Maximal degree in co-relation 32792. Up to 7128 conditions per place. [2024-06-27 22:39:53,293 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 136 selfloop transitions, 71 changer transitions 0/213 dead transitions. [2024-06-27 22:39:53,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 213 transitions, 2299 flow [2024-06-27 22:39:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:39:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:39:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-27 22:39:53,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:39:53,296 INFO L175 Difference]: Start difference. First operand has 114 places, 155 transitions, 1642 flow. Second operand 9 states and 192 transitions. [2024-06-27 22:39:53,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 213 transitions, 2299 flow [2024-06-27 22:39:53,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 213 transitions, 2177 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 22:39:53,347 INFO L231 Difference]: Finished difference. Result has 118 places, 164 transitions, 1784 flow [2024-06-27 22:39:53,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1784, PETRI_PLACES=118, PETRI_TRANSITIONS=164} [2024-06-27 22:39:53,348 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 64 predicate places. [2024-06-27 22:39:53,348 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 164 transitions, 1784 flow [2024-06-27 22:39:53,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:53,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:53,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:53,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:39:53,349 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:39:53,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash 501893222, now seen corresponding path program 4 times [2024-06-27 22:39:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:53,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641265110] [2024-06-27 22:39:53,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:53,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641265110] [2024-06-27 22:39:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641265110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:58,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:58,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671209291] [2024-06-27 22:39:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:58,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:58,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:39:58,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 164 transitions, 1784 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:58,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:58,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:39:58,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:01,119 INFO L124 PetriNetUnfolderBase]: 5437/8357 cut-off events. [2024-06-27 22:40:01,119 INFO L125 PetriNetUnfolderBase]: For 52025/52029 co-relation queries the response was YES. [2024-06-27 22:40:01,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35752 conditions, 8357 events. 5437/8357 cut-off events. For 52025/52029 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 47876 event pairs, 1859 based on Foata normal form. 2/8165 useless extension candidates. Maximal degree in co-relation 35696. Up to 7297 conditions per place. [2024-06-27 22:40:01,163 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 157 selfloop transitions, 92 changer transitions 0/255 dead transitions. [2024-06-27 22:40:01,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 255 transitions, 2801 flow [2024-06-27 22:40:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-27 22:40:01,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182291666666666 [2024-06-27 22:40:01,165 INFO L175 Difference]: Start difference. First operand has 118 places, 164 transitions, 1784 flow. Second operand 8 states and 199 transitions. [2024-06-27 22:40:01,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 255 transitions, 2801 flow [2024-06-27 22:40:01,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 255 transitions, 2582 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-27 22:40:01,239 INFO L231 Difference]: Finished difference. Result has 120 places, 190 transitions, 2131 flow [2024-06-27 22:40:01,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2131, PETRI_PLACES=120, PETRI_TRANSITIONS=190} [2024-06-27 22:40:01,240 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 66 predicate places. [2024-06-27 22:40:01,240 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 190 transitions, 2131 flow [2024-06-27 22:40:01,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:01,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:01,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:01,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:40:01,241 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:40:01,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash 599749630, now seen corresponding path program 1 times [2024-06-27 22:40:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:01,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654370908] [2024-06-27 22:40:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:10,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654370908] [2024-06-27 22:40:10,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654370908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:10,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:10,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:40:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280666488] [2024-06-27 22:40:10,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:10,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:40:10,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:10,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:40:10,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:40:10,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:40:10,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 190 transitions, 2131 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-27 22:40:10,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:10,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:40:10,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:12,911 INFO L124 PetriNetUnfolderBase]: 5479/8514 cut-off events. [2024-06-27 22:40:12,911 INFO L125 PetriNetUnfolderBase]: For 59227/59242 co-relation queries the response was YES. [2024-06-27 22:40:12,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37383 conditions, 8514 events. 5479/8514 cut-off events. For 59227/59242 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 49750 event pairs, 1774 based on Foata normal form. 20/8306 useless extension candidates. Maximal degree in co-relation 37326. Up to 7307 conditions per place. [2024-06-27 22:40:12,972 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 159 selfloop transitions, 78 changer transitions 0/243 dead transitions. [2024-06-27 22:40:12,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 243 transitions, 2816 flow [2024-06-27 22:40:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-27 22:40:12,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635416666666667 [2024-06-27 22:40:12,974 INFO L175 Difference]: Start difference. First operand has 120 places, 190 transitions, 2131 flow. Second operand 8 states and 178 transitions. [2024-06-27 22:40:12,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 243 transitions, 2816 flow [2024-06-27 22:40:13,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 243 transitions, 2647 flow, removed 46 selfloop flow, removed 3 redundant places. [2024-06-27 22:40:13,056 INFO L231 Difference]: Finished difference. Result has 125 places, 193 transitions, 2186 flow [2024-06-27 22:40:13,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2186, PETRI_PLACES=125, PETRI_TRANSITIONS=193} [2024-06-27 22:40:13,057 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 71 predicate places. [2024-06-27 22:40:13,057 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 193 transitions, 2186 flow [2024-06-27 22:40:13,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-27 22:40:13,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:13,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:13,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:40:13,058 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:40:13,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1284112615, now seen corresponding path program 1 times [2024-06-27 22:40:13,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:13,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697477348] [2024-06-27 22:40:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697477348] [2024-06-27 22:40:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697477348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501655567] [2024-06-27 22:40:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:19,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:19,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:40:19,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 193 transitions, 2186 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:19,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:19,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:40:19,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:22,298 INFO L124 PetriNetUnfolderBase]: 5566/8662 cut-off events. [2024-06-27 22:40:22,298 INFO L125 PetriNetUnfolderBase]: For 67988/67996 co-relation queries the response was YES. [2024-06-27 22:40:22,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38650 conditions, 8662 events. 5566/8662 cut-off events. For 67988/67996 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 50869 event pairs, 1883 based on Foata normal form. 10/8438 useless extension candidates. Maximal degree in co-relation 38591. Up to 7454 conditions per place. [2024-06-27 22:40:22,357 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 189 selfloop transitions, 75 changer transitions 0/270 dead transitions. [2024-06-27 22:40:22,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 270 transitions, 3104 flow [2024-06-27 22:40:22,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-06-27 22:40:22,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-06-27 22:40:22,358 INFO L175 Difference]: Start difference. First operand has 125 places, 193 transitions, 2186 flow. Second operand 8 states and 198 transitions. [2024-06-27 22:40:22,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 270 transitions, 3104 flow [2024-06-27 22:40:22,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 270 transitions, 2926 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 22:40:22,436 INFO L231 Difference]: Finished difference. Result has 129 places, 208 transitions, 2374 flow [2024-06-27 22:40:22,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2374, PETRI_PLACES=129, PETRI_TRANSITIONS=208} [2024-06-27 22:40:22,436 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 75 predicate places. [2024-06-27 22:40:22,437 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 208 transitions, 2374 flow [2024-06-27 22:40:22,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:22,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:22,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:22,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:40:22,437 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:40:22,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1394937461, now seen corresponding path program 2 times [2024-06-27 22:40:22,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:22,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668102118] [2024-06-27 22:40:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:31,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:31,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668102118] [2024-06-27 22:40:31,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668102118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:31,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:31,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:31,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526638729] [2024-06-27 22:40:31,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:31,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:31,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:31,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:31,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:31,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:40:31,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 208 transitions, 2374 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:31,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:31,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:40:31,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:34,117 INFO L124 PetriNetUnfolderBase]: 5601/8721 cut-off events. [2024-06-27 22:40:34,117 INFO L125 PetriNetUnfolderBase]: For 75877/75885 co-relation queries the response was YES. [2024-06-27 22:40:34,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40572 conditions, 8721 events. 5601/8721 cut-off events. For 75877/75885 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 51341 event pairs, 1892 based on Foata normal form. 10/8493 useless extension candidates. Maximal degree in co-relation 40511. Up to 7529 conditions per place. [2024-06-27 22:40:34,175 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 196 selfloop transitions, 77 changer transitions 0/279 dead transitions. [2024-06-27 22:40:34,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 279 transitions, 3266 flow [2024-06-27 22:40:34,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-06-27 22:40:34,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2024-06-27 22:40:34,177 INFO L175 Difference]: Start difference. First operand has 129 places, 208 transitions, 2374 flow. Second operand 8 states and 195 transitions. [2024-06-27 22:40:34,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 279 transitions, 3266 flow [2024-06-27 22:40:34,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 279 transitions, 3164 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-27 22:40:34,265 INFO L231 Difference]: Finished difference. Result has 135 places, 218 transitions, 2636 flow [2024-06-27 22:40:34,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2272, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2636, PETRI_PLACES=135, PETRI_TRANSITIONS=218} [2024-06-27 22:40:34,266 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 81 predicate places. [2024-06-27 22:40:34,266 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 218 transitions, 2636 flow [2024-06-27 22:40:34,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:34,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:34,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:34,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:40:34,267 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:40:34,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:34,267 INFO L85 PathProgramCache]: Analyzing trace with hash -513206172, now seen corresponding path program 1 times [2024-06-27 22:40:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:34,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52823028] [2024-06-27 22:40:34,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:34,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:42,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:42,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52823028] [2024-06-27 22:40:42,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52823028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:42,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:42,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:42,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174341065] [2024-06-27 22:40:42,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:42,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:42,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:42,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:42,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:42,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:40:42,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 218 transitions, 2636 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:42,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:42,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:40:42,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:44,498 INFO L124 PetriNetUnfolderBase]: 5699/8620 cut-off events. [2024-06-27 22:40:44,498 INFO L125 PetriNetUnfolderBase]: For 91134/91167 co-relation queries the response was YES. [2024-06-27 22:40:44,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43509 conditions, 8620 events. 5699/8620 cut-off events. For 91134/91167 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 49189 event pairs, 1822 based on Foata normal form. 34/8494 useless extension candidates. Maximal degree in co-relation 43446. Up to 7589 conditions per place. [2024-06-27 22:40:44,562 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 207 selfloop transitions, 66 changer transitions 0/279 dead transitions. [2024-06-27 22:40:44,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 279 transitions, 3587 flow [2024-06-27 22:40:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:40:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:40:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-27 22:40:44,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029761904761905 [2024-06-27 22:40:44,563 INFO L175 Difference]: Start difference. First operand has 135 places, 218 transitions, 2636 flow. Second operand 7 states and 169 transitions. [2024-06-27 22:40:44,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 279 transitions, 3587 flow [2024-06-27 22:40:44,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 279 transitions, 3411 flow, removed 61 selfloop flow, removed 3 redundant places. [2024-06-27 22:40:44,700 INFO L231 Difference]: Finished difference. Result has 141 places, 228 transitions, 2826 flow [2024-06-27 22:40:44,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2500, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2826, PETRI_PLACES=141, PETRI_TRANSITIONS=228} [2024-06-27 22:40:44,701 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 87 predicate places. [2024-06-27 22:40:44,701 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 228 transitions, 2826 flow [2024-06-27 22:40:44,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:44,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:44,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:44,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:40:44,702 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:40:44,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:44,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1910542870, now seen corresponding path program 2 times [2024-06-27 22:40:44,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097729143] [2024-06-27 22:40:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:50,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:50,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097729143] [2024-06-27 22:40:50,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097729143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:50,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:50,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:40:50,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375161696] [2024-06-27 22:40:50,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:50,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:40:50,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:50,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:40:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:40:50,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:40:50,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 228 transitions, 2826 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-27 22:40:50,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:50,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:40:50,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:52,618 INFO L124 PetriNetUnfolderBase]: 5745/8679 cut-off events. [2024-06-27 22:40:52,618 INFO L125 PetriNetUnfolderBase]: For 99000/99015 co-relation queries the response was YES. [2024-06-27 22:40:52,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45658 conditions, 8679 events. 5745/8679 cut-off events. For 99000/99015 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 49347 event pairs, 1826 based on Foata normal form. 16/8535 useless extension candidates. Maximal degree in co-relation 45591. Up to 7737 conditions per place. [2024-06-27 22:40:52,684 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 201 selfloop transitions, 67 changer transitions 0/274 dead transitions. [2024-06-27 22:40:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 274 transitions, 3644 flow [2024-06-27 22:40:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-27 22:40:52,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4453125 [2024-06-27 22:40:52,687 INFO L175 Difference]: Start difference. First operand has 141 places, 228 transitions, 2826 flow. Second operand 8 states and 171 transitions. [2024-06-27 22:40:52,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 274 transitions, 3644 flow [2024-06-27 22:40:52,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 274 transitions, 3562 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-27 22:40:52,832 INFO L231 Difference]: Finished difference. Result has 147 places, 232 transitions, 2962 flow [2024-06-27 22:40:52,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2752, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2962, PETRI_PLACES=147, PETRI_TRANSITIONS=232} [2024-06-27 22:40:52,833 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 93 predicate places. [2024-06-27 22:40:52,833 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 232 transitions, 2962 flow [2024-06-27 22:40:52,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-27 22:40:52,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:52,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:52,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:40:52,833 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:40:52,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1287921895, now seen corresponding path program 3 times [2024-06-27 22:40:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434855380] [2024-06-27 22:40:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:00,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:00,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434855380] [2024-06-27 22:41:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434855380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:00,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:00,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:00,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134858064] [2024-06-27 22:41:00,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:00,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:00,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:00,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:00,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:41:00,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 232 transitions, 2962 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:00,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:00,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:41:00,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:02,769 INFO L124 PetriNetUnfolderBase]: 5776/8850 cut-off events. [2024-06-27 22:41:02,770 INFO L125 PetriNetUnfolderBase]: For 103429/103437 co-relation queries the response was YES. [2024-06-27 22:41:02,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46482 conditions, 8850 events. 5776/8850 cut-off events. For 103429/103437 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 50899 event pairs, 1767 based on Foata normal form. 6/8655 useless extension candidates. Maximal degree in co-relation 46413. Up to 7728 conditions per place. [2024-06-27 22:41:02,849 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 202 selfloop transitions, 92 changer transitions 0/300 dead transitions. [2024-06-27 22:41:02,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 300 transitions, 3862 flow [2024-06-27 22:41:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:41:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:41:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-06-27 22:41:02,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699074074074074 [2024-06-27 22:41:02,851 INFO L175 Difference]: Start difference. First operand has 147 places, 232 transitions, 2962 flow. Second operand 9 states and 203 transitions. [2024-06-27 22:41:02,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 300 transitions, 3862 flow [2024-06-27 22:41:03,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 300 transitions, 3680 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-27 22:41:03,051 INFO L231 Difference]: Finished difference. Result has 150 places, 238 transitions, 3087 flow [2024-06-27 22:41:03,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2786, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3087, PETRI_PLACES=150, PETRI_TRANSITIONS=238} [2024-06-27 22:41:03,052 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 96 predicate places. [2024-06-27 22:41:03,052 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 238 transitions, 3087 flow [2024-06-27 22:41:03,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:03,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:03,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:03,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:41:03,052 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:41:03,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 109321832, now seen corresponding path program 3 times [2024-06-27 22:41:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:03,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567363797] [2024-06-27 22:41:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:08,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:08,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567363797] [2024-06-27 22:41:08,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567363797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:08,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:08,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:41:08,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762655822] [2024-06-27 22:41:08,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:08,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:41:08,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:08,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:41:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:41:08,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:41:08,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 238 transitions, 3087 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-27 22:41:08,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:08,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:41:08,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:11,058 INFO L124 PetriNetUnfolderBase]: 5766/8710 cut-off events. [2024-06-27 22:41:11,058 INFO L125 PetriNetUnfolderBase]: For 111566/111581 co-relation queries the response was YES. [2024-06-27 22:41:11,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47051 conditions, 8710 events. 5766/8710 cut-off events. For 111566/111581 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 49579 event pairs, 1821 based on Foata normal form. 16/8565 useless extension candidates. Maximal degree in co-relation 46982. Up to 7950 conditions per place. [2024-06-27 22:41:11,132 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 220 selfloop transitions, 52 changer transitions 0/278 dead transitions. [2024-06-27 22:41:11,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 278 transitions, 3766 flow [2024-06-27 22:41:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:41:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:41:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-06-27 22:41:11,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2024-06-27 22:41:11,133 INFO L175 Difference]: Start difference. First operand has 150 places, 238 transitions, 3087 flow. Second operand 7 states and 159 transitions. [2024-06-27 22:41:11,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 278 transitions, 3766 flow [2024-06-27 22:41:11,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 278 transitions, 3550 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 22:41:11,346 INFO L231 Difference]: Finished difference. Result has 152 places, 240 transitions, 3031 flow [2024-06-27 22:41:11,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2871, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3031, PETRI_PLACES=152, PETRI_TRANSITIONS=240} [2024-06-27 22:41:11,346 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 98 predicate places. [2024-06-27 22:41:11,347 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 240 transitions, 3031 flow [2024-06-27 22:41:11,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-27 22:41:11,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:11,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:11,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:41:11,347 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:41:11,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2061333999, now seen corresponding path program 4 times [2024-06-27 22:41:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:11,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857549064] [2024-06-27 22:41:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:17,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857549064] [2024-06-27 22:41:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857549064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:17,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823081252] [2024-06-27 22:41:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:17,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:17,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:17,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:41:17,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 240 transitions, 3031 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:17,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:17,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:41:17,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:20,448 INFO L124 PetriNetUnfolderBase]: 5947/8963 cut-off events. [2024-06-27 22:41:20,448 INFO L125 PetriNetUnfolderBase]: For 118323/118338 co-relation queries the response was YES. [2024-06-27 22:41:20,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48840 conditions, 8963 events. 5947/8963 cut-off events. For 118323/118338 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 50927 event pairs, 1823 based on Foata normal form. 18/8820 useless extension candidates. Maximal degree in co-relation 48769. Up to 7909 conditions per place. [2024-06-27 22:41:20,515 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 223 selfloop transitions, 91 changer transitions 0/320 dead transitions. [2024-06-27 22:41:20,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 320 transitions, 4295 flow [2024-06-27 22:41:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:41:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:41:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-27 22:41:20,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-27 22:41:20,516 INFO L175 Difference]: Start difference. First operand has 152 places, 240 transitions, 3031 flow. Second operand 8 states and 190 transitions. [2024-06-27 22:41:20,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 320 transitions, 4295 flow [2024-06-27 22:41:20,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 320 transitions, 4153 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-27 22:41:20,675 INFO L231 Difference]: Finished difference. Result has 157 places, 269 transitions, 3521 flow [2024-06-27 22:41:20,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2918, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3521, PETRI_PLACES=157, PETRI_TRANSITIONS=269} [2024-06-27 22:41:20,676 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 103 predicate places. [2024-06-27 22:41:20,676 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 269 transitions, 3521 flow [2024-06-27 22:41:20,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:20,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:20,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:20,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:41:20,676 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:41:20,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:20,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1621176183, now seen corresponding path program 5 times [2024-06-27 22:41:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:20,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136621071] [2024-06-27 22:41:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:20,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:27,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:27,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136621071] [2024-06-27 22:41:27,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136621071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:27,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:27,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399551236] [2024-06-27 22:41:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:27,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:27,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:41:27,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 269 transitions, 3521 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:27,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:27,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:41:27,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:30,336 INFO L124 PetriNetUnfolderBase]: 6016/9063 cut-off events. [2024-06-27 22:41:30,336 INFO L125 PetriNetUnfolderBase]: For 133012/133012 co-relation queries the response was YES. [2024-06-27 22:41:30,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52618 conditions, 9063 events. 6016/9063 cut-off events. For 133012/133012 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 51503 event pairs, 1814 based on Foata normal form. 2/8904 useless extension candidates. Maximal degree in co-relation 52545. Up to 8351 conditions per place. [2024-06-27 22:41:30,416 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 275 selfloop transitions, 73 changer transitions 0/354 dead transitions. [2024-06-27 22:41:30,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 354 transitions, 4664 flow [2024-06-27 22:41:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:41:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:41:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-06-27 22:41:30,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-27 22:41:30,418 INFO L175 Difference]: Start difference. First operand has 157 places, 269 transitions, 3521 flow. Second operand 9 states and 212 transitions. [2024-06-27 22:41:30,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 354 transitions, 4664 flow [2024-06-27 22:41:30,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 354 transitions, 4483 flow, removed 64 selfloop flow, removed 3 redundant places. [2024-06-27 22:41:30,735 INFO L231 Difference]: Finished difference. Result has 165 places, 288 transitions, 3843 flow [2024-06-27 22:41:30,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3346, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3843, PETRI_PLACES=165, PETRI_TRANSITIONS=288} [2024-06-27 22:41:30,735 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 111 predicate places. [2024-06-27 22:41:30,736 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 288 transitions, 3843 flow [2024-06-27 22:41:30,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:30,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:30,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:30,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:41:30,736 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:41:30,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash -647208803, now seen corresponding path program 1 times [2024-06-27 22:41:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962362444] [2024-06-27 22:41:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:37,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:37,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962362444] [2024-06-27 22:41:37,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962362444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:37,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:37,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:37,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122247323] [2024-06-27 22:41:37,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:37,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:37,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:37,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:37,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:41:37,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 288 transitions, 3843 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:37,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:37,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:41:37,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:40,440 INFO L124 PetriNetUnfolderBase]: 6143/9286 cut-off events. [2024-06-27 22:41:40,440 INFO L125 PetriNetUnfolderBase]: For 157533/157547 co-relation queries the response was YES. [2024-06-27 22:41:40,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55773 conditions, 9286 events. 6143/9286 cut-off events. For 157533/157547 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 53230 event pairs, 1393 based on Foata normal form. 12/9127 useless extension candidates. Maximal degree in co-relation 55696. Up to 8037 conditions per place. [2024-06-27 22:41:40,517 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 263 selfloop transitions, 100 changer transitions 0/369 dead transitions. [2024-06-27 22:41:40,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 369 transitions, 5052 flow [2024-06-27 22:41:40,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:41:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:41:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-27 22:41:40,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-27 22:41:40,519 INFO L175 Difference]: Start difference. First operand has 165 places, 288 transitions, 3843 flow. Second operand 8 states and 210 transitions. [2024-06-27 22:41:40,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 369 transitions, 5052 flow [2024-06-27 22:41:40,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 369 transitions, 4897 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-27 22:41:40,770 INFO L231 Difference]: Finished difference. Result has 171 places, 301 transitions, 4149 flow [2024-06-27 22:41:40,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3688, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4149, PETRI_PLACES=171, PETRI_TRANSITIONS=301} [2024-06-27 22:41:40,771 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 117 predicate places. [2024-06-27 22:41:40,771 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 301 transitions, 4149 flow [2024-06-27 22:41:40,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:40,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:40,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:40,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:41:40,771 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:41:40,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1267679687, now seen corresponding path program 2 times [2024-06-27 22:41:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:40,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206337093] [2024-06-27 22:41:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:40,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:47,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206337093] [2024-06-27 22:41:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206337093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:47,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786821443] [2024-06-27 22:41:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:47,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:47,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:47,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:47,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:41:47,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 301 transitions, 4149 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:47,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:47,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:41:47,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:50,755 INFO L124 PetriNetUnfolderBase]: 6280/9499 cut-off events. [2024-06-27 22:41:50,755 INFO L125 PetriNetUnfolderBase]: For 177646/177660 co-relation queries the response was YES. [2024-06-27 22:41:50,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59289 conditions, 9499 events. 6280/9499 cut-off events. For 177646/177660 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 54706 event pairs, 1746 based on Foata normal form. 12/9334 useless extension candidates. Maximal degree in co-relation 59208. Up to 8340 conditions per place. [2024-06-27 22:41:50,845 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 278 selfloop transitions, 117 changer transitions 0/401 dead transitions. [2024-06-27 22:41:50,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 401 transitions, 5583 flow [2024-06-27 22:41:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:41:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:41:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-06-27 22:41:50,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5546875 [2024-06-27 22:41:50,846 INFO L175 Difference]: Start difference. First operand has 171 places, 301 transitions, 4149 flow. Second operand 8 states and 213 transitions. [2024-06-27 22:41:50,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 401 transitions, 5583 flow [2024-06-27 22:41:51,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 401 transitions, 5334 flow, removed 79 selfloop flow, removed 3 redundant places. [2024-06-27 22:41:51,241 INFO L231 Difference]: Finished difference. Result has 177 places, 327 transitions, 4642 flow [2024-06-27 22:41:51,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3934, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4642, PETRI_PLACES=177, PETRI_TRANSITIONS=327} [2024-06-27 22:41:51,242 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 123 predicate places. [2024-06-27 22:41:51,242 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 327 transitions, 4642 flow [2024-06-27 22:41:51,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:51,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:51,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:51,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:41:51,242 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:41:51,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1267679811, now seen corresponding path program 1 times [2024-06-27 22:41:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287102123] [2024-06-27 22:41:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287102123] [2024-06-27 22:41:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287102123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:41:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273274864] [2024-06-27 22:41:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:57,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:41:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:57,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:41:57,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:41:57,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:41:57,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 327 transitions, 4642 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:57,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:57,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:41:57,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:00,768 INFO L124 PetriNetUnfolderBase]: 6470/9965 cut-off events. [2024-06-27 22:42:00,768 INFO L125 PetriNetUnfolderBase]: For 196929/196944 co-relation queries the response was YES. [2024-06-27 22:42:00,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63326 conditions, 9965 events. 6470/9965 cut-off events. For 196929/196944 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 58720 event pairs, 1650 based on Foata normal form. 16/9733 useless extension candidates. Maximal degree in co-relation 63242. Up to 8086 conditions per place. [2024-06-27 22:42:00,854 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 289 selfloop transitions, 152 changer transitions 0/447 dead transitions. [2024-06-27 22:42:00,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 447 transitions, 6537 flow [2024-06-27 22:42:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:42:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:42:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2024-06-27 22:42:00,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5395833333333333 [2024-06-27 22:42:00,856 INFO L175 Difference]: Start difference. First operand has 177 places, 327 transitions, 4642 flow. Second operand 10 states and 259 transitions. [2024-06-27 22:42:00,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 447 transitions, 6537 flow [2024-06-27 22:42:01,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 447 transitions, 6285 flow, removed 92 selfloop flow, removed 2 redundant places. [2024-06-27 22:42:01,267 INFO L231 Difference]: Finished difference. Result has 189 places, 354 transitions, 5359 flow [2024-06-27 22:42:01,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4390, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5359, PETRI_PLACES=189, PETRI_TRANSITIONS=354} [2024-06-27 22:42:01,268 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 135 predicate places. [2024-06-27 22:42:01,268 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 354 transitions, 5359 flow [2024-06-27 22:42:01,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:01,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:01,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:01,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:42:01,269 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:01,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1155585185, now seen corresponding path program 2 times [2024-06-27 22:42:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065859169] [2024-06-27 22:42:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065859169] [2024-06-27 22:42:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065859169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:10,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:10,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:42:10,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560626129] [2024-06-27 22:42:10,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:10,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:42:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:42:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:42:10,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:42:10,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 354 transitions, 5359 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:10,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:10,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:42:10,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:13,811 INFO L124 PetriNetUnfolderBase]: 6584/9957 cut-off events. [2024-06-27 22:42:13,811 INFO L125 PetriNetUnfolderBase]: For 245855/245894 co-relation queries the response was YES. [2024-06-27 22:42:13,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69396 conditions, 9957 events. 6584/9957 cut-off events. For 245855/245894 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 57741 event pairs, 1648 based on Foata normal form. 34/9800 useless extension candidates. Maximal degree in co-relation 69306. Up to 8647 conditions per place. [2024-06-27 22:42:13,905 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 328 selfloop transitions, 92 changer transitions 0/426 dead transitions. [2024-06-27 22:42:13,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 426 transitions, 6764 flow [2024-06-27 22:42:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:42:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:42:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 22:42:13,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:42:13,906 INFO L175 Difference]: Start difference. First operand has 189 places, 354 transitions, 5359 flow. Second operand 8 states and 196 transitions. [2024-06-27 22:42:13,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 426 transitions, 6764 flow [2024-06-27 22:42:14,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 426 transitions, 6433 flow, removed 118 selfloop flow, removed 3 redundant places. [2024-06-27 22:42:14,407 INFO L231 Difference]: Finished difference. Result has 195 places, 363 transitions, 5412 flow [2024-06-27 22:42:14,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5028, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5412, PETRI_PLACES=195, PETRI_TRANSITIONS=363} [2024-06-27 22:42:14,408 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 141 predicate places. [2024-06-27 22:42:14,408 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 363 transitions, 5412 flow [2024-06-27 22:42:14,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:14,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:14,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:14,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:42:14,409 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:14,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1155585061, now seen corresponding path program 3 times [2024-06-27 22:42:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:14,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306594811] [2024-06-27 22:42:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:23,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306594811] [2024-06-27 22:42:23,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306594811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:23,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:23,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:42:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307216958] [2024-06-27 22:42:23,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:23,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:42:23,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:23,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:42:23,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:42:23,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:42:23,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 363 transitions, 5412 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:23,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:23,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:42:23,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:27,137 INFO L124 PetriNetUnfolderBase]: 6589/9983 cut-off events. [2024-06-27 22:42:27,137 INFO L125 PetriNetUnfolderBase]: For 254933/254947 co-relation queries the response was YES. [2024-06-27 22:42:27,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70160 conditions, 9983 events. 6589/9983 cut-off events. For 254933/254947 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 58067 event pairs, 1739 based on Foata normal form. 12/9799 useless extension candidates. Maximal degree in co-relation 70067. Up to 8883 conditions per place. [2024-06-27 22:42:27,250 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 344 selfloop transitions, 84 changer transitions 0/434 dead transitions. [2024-06-27 22:42:27,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 434 transitions, 6570 flow [2024-06-27 22:42:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:42:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:42:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 22:42:27,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:42:27,251 INFO L175 Difference]: Start difference. First operand has 195 places, 363 transitions, 5412 flow. Second operand 9 states and 216 transitions. [2024-06-27 22:42:27,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 434 transitions, 6570 flow [2024-06-27 22:42:27,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 434 transitions, 6393 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-27 22:42:27,823 INFO L231 Difference]: Finished difference. Result has 200 places, 365 transitions, 5484 flow [2024-06-27 22:42:27,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5235, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5484, PETRI_PLACES=200, PETRI_TRANSITIONS=365} [2024-06-27 22:42:27,824 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 146 predicate places. [2024-06-27 22:42:27,824 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 365 transitions, 5484 flow [2024-06-27 22:42:27,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:27,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:27,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:27,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:42:27,825 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:27,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1270480971, now seen corresponding path program 3 times [2024-06-27 22:42:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676842604] [2024-06-27 22:42:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:36,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:36,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676842604] [2024-06-27 22:42:36,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676842604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:36,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:36,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:42:36,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132024671] [2024-06-27 22:42:36,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:36,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:42:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:36,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:42:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:42:36,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:42:36,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 365 transitions, 5484 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:36,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:36,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:42:36,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:39,687 INFO L124 PetriNetUnfolderBase]: 6579/9956 cut-off events. [2024-06-27 22:42:39,688 INFO L125 PetriNetUnfolderBase]: For 261442/261481 co-relation queries the response was YES. [2024-06-27 22:42:39,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70398 conditions, 9956 events. 6579/9956 cut-off events. For 261442/261481 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 57875 event pairs, 1661 based on Foata normal form. 34/9797 useless extension candidates. Maximal degree in co-relation 70303. Up to 8715 conditions per place. [2024-06-27 22:42:39,788 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 330 selfloop transitions, 88 changer transitions 0/424 dead transitions. [2024-06-27 22:42:39,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 424 transitions, 6560 flow [2024-06-27 22:42:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:42:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:42:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 22:42:39,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2024-06-27 22:42:39,791 INFO L175 Difference]: Start difference. First operand has 200 places, 365 transitions, 5484 flow. Second operand 8 states and 191 transitions. [2024-06-27 22:42:39,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 424 transitions, 6560 flow [2024-06-27 22:42:40,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 424 transitions, 6326 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 22:42:40,277 INFO L231 Difference]: Finished difference. Result has 202 places, 365 transitions, 5434 flow [2024-06-27 22:42:40,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5250, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5434, PETRI_PLACES=202, PETRI_TRANSITIONS=365} [2024-06-27 22:42:40,278 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 148 predicate places. [2024-06-27 22:42:40,278 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 365 transitions, 5434 flow [2024-06-27 22:42:40,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:40,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:40,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:40,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:42:40,278 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:40,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:40,279 INFO L85 PathProgramCache]: Analyzing trace with hash -902530379, now seen corresponding path program 1 times [2024-06-27 22:42:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102379386] [2024-06-27 22:42:40,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:46,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:46,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102379386] [2024-06-27 22:42:46,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102379386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:46,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:46,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:42:46,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189474021] [2024-06-27 22:42:46,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:46,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:42:46,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:46,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:42:46,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:42:46,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:42:46,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 365 transitions, 5434 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:46,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:46,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:42:46,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:49,630 INFO L124 PetriNetUnfolderBase]: 6590/10155 cut-off events. [2024-06-27 22:42:49,631 INFO L125 PetriNetUnfolderBase]: For 256594/256609 co-relation queries the response was YES. [2024-06-27 22:42:49,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70317 conditions, 10155 events. 6590/10155 cut-off events. For 256594/256609 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 60044 event pairs, 1662 based on Foata normal form. 14/9913 useless extension candidates. Maximal degree in co-relation 70221. Up to 8855 conditions per place. [2024-06-27 22:42:49,737 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 319 selfloop transitions, 94 changer transitions 0/419 dead transitions. [2024-06-27 22:42:49,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 419 transitions, 6620 flow [2024-06-27 22:42:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:42:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:42:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-27 22:42:49,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635416666666667 [2024-06-27 22:42:49,739 INFO L175 Difference]: Start difference. First operand has 202 places, 365 transitions, 5434 flow. Second operand 8 states and 178 transitions. [2024-06-27 22:42:49,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 419 transitions, 6620 flow [2024-06-27 22:42:50,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 419 transitions, 6419 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 22:42:50,391 INFO L231 Difference]: Finished difference. Result has 203 places, 370 transitions, 5598 flow [2024-06-27 22:42:50,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5241, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5598, PETRI_PLACES=203, PETRI_TRANSITIONS=370} [2024-06-27 22:42:50,392 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 149 predicate places. [2024-06-27 22:42:50,392 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 370 transitions, 5598 flow [2024-06-27 22:42:50,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:50,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:50,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:50,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:42:50,393 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:42:50,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1271053985, now seen corresponding path program 4 times [2024-06-27 22:42:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:50,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808814878] [2024-06-27 22:42:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808814878] [2024-06-27 22:42:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808814878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:56,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:42:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43405142] [2024-06-27 22:42:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:56,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:42:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:42:56,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:42:56,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:42:56,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 370 transitions, 5598 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:56,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:56,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:42:56,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:59,507 INFO L124 PetriNetUnfolderBase]: 6613/10018 cut-off events. [2024-06-27 22:42:59,507 INFO L125 PetriNetUnfolderBase]: For 271303/271318 co-relation queries the response was YES. [2024-06-27 22:42:59,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71442 conditions, 10018 events. 6613/10018 cut-off events. For 271303/271318 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 58233 event pairs, 1720 based on Foata normal form. 14/9832 useless extension candidates. Maximal degree in co-relation 71345. Up to 9124 conditions per place. [2024-06-27 22:42:59,604 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 356 selfloop transitions, 58 changer transitions 0/420 dead transitions. [2024-06-27 22:42:59,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 420 transitions, 6646 flow [2024-06-27 22:42:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:42:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:42:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-27 22:42:59,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:42:59,606 INFO L175 Difference]: Start difference. First operand has 203 places, 370 transitions, 5598 flow. Second operand 7 states and 168 transitions. [2024-06-27 22:42:59,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 420 transitions, 6646 flow [2024-06-27 22:43:00,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 420 transitions, 6365 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-06-27 22:43:00,172 INFO L231 Difference]: Finished difference. Result has 204 places, 375 transitions, 5546 flow [2024-06-27 22:43:00,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5317, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5546, PETRI_PLACES=204, PETRI_TRANSITIONS=375} [2024-06-27 22:43:00,173 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 150 predicate places. [2024-06-27 22:43:00,173 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 375 transitions, 5546 flow [2024-06-27 22:43:00,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:00,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:00,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:00,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:43:00,173 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:00,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:00,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1270881005, now seen corresponding path program 5 times [2024-06-27 22:43:00,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:00,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056944272] [2024-06-27 22:43:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:00,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:07,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-27 22:43:07,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:07,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056944272] [2024-06-27 22:43:07,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056944272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:07,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:07,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:43:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292186660] [2024-06-27 22:43:07,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:07,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:43:07,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:07,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:43:07,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:43:07,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:43:07,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 375 transitions, 5546 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:07,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:07,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:43:07,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:10,782 INFO L124 PetriNetUnfolderBase]: 6715/10343 cut-off events. [2024-06-27 22:43:10,782 INFO L125 PetriNetUnfolderBase]: For 277441/277456 co-relation queries the response was YES. [2024-06-27 22:43:10,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72838 conditions, 10343 events. 6715/10343 cut-off events. For 277441/277456 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 61260 event pairs, 1662 based on Foata normal form. 16/10098 useless extension candidates. Maximal degree in co-relation 72741. Up to 8626 conditions per place. [2024-06-27 22:43:10,908 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 305 selfloop transitions, 137 changer transitions 0/448 dead transitions. [2024-06-27 22:43:10,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 448 transitions, 7053 flow [2024-06-27 22:43:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:43:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:43:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2024-06-27 22:43:10,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-06-27 22:43:10,909 INFO L175 Difference]: Start difference. First operand has 204 places, 375 transitions, 5546 flow. Second operand 10 states and 215 transitions. [2024-06-27 22:43:10,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 448 transitions, 7053 flow [2024-06-27 22:43:11,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 448 transitions, 6915 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-27 22:43:11,658 INFO L231 Difference]: Finished difference. Result has 211 places, 386 transitions, 6032 flow [2024-06-27 22:43:11,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5408, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6032, PETRI_PLACES=211, PETRI_TRANSITIONS=386} [2024-06-27 22:43:11,658 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 157 predicate places. [2024-06-27 22:43:11,658 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 386 transitions, 6032 flow [2024-06-27 22:43:11,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:11,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:11,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:11,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:43:11,659 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:11,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1312288465, now seen corresponding path program 4 times [2024-06-27 22:43:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:11,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051611147] [2024-06-27 22:43:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051611147] [2024-06-27 22:43:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051611147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:18,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:43:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745821620] [2024-06-27 22:43:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:18,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:43:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:43:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:43:18,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:43:18,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 386 transitions, 6032 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:18,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:18,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:43:18,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:22,888 INFO L124 PetriNetUnfolderBase]: 7512/11370 cut-off events. [2024-06-27 22:43:22,889 INFO L125 PetriNetUnfolderBase]: For 357011/357021 co-relation queries the response was YES. [2024-06-27 22:43:22,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84821 conditions, 11370 events. 7512/11370 cut-off events. For 357011/357021 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 66690 event pairs, 1639 based on Foata normal form. 4/11147 useless extension candidates. Maximal degree in co-relation 84722. Up to 9085 conditions per place. [2024-06-27 22:43:22,993 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 323 selfloop transitions, 168 changer transitions 0/497 dead transitions. [2024-06-27 22:43:22,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 497 transitions, 7874 flow [2024-06-27 22:43:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:43:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:43:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2024-06-27 22:43:22,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5671296296296297 [2024-06-27 22:43:22,994 INFO L175 Difference]: Start difference. First operand has 211 places, 386 transitions, 6032 flow. Second operand 9 states and 245 transitions. [2024-06-27 22:43:22,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 497 transitions, 7874 flow [2024-06-27 22:43:23,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 497 transitions, 7535 flow, removed 128 selfloop flow, removed 5 redundant places. [2024-06-27 22:43:23,799 INFO L231 Difference]: Finished difference. Result has 217 places, 406 transitions, 6590 flow [2024-06-27 22:43:23,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5729, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6590, PETRI_PLACES=217, PETRI_TRANSITIONS=406} [2024-06-27 22:43:23,799 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 163 predicate places. [2024-06-27 22:43:23,799 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 406 transitions, 6590 flow [2024-06-27 22:43:23,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:23,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:23,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:23,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:43:23,800 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:23,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash -529060549, now seen corresponding path program 6 times [2024-06-27 22:43:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:23,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967803139] [2024-06-27 22:43:23,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967803139] [2024-06-27 22:43:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967803139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:30,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:30,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:43:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143403282] [2024-06-27 22:43:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:30,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:43:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:43:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:43:30,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:43:30,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 406 transitions, 6590 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:30,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:30,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:43:30,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:33,425 INFO L124 PetriNetUnfolderBase]: 7699/11652 cut-off events. [2024-06-27 22:43:33,425 INFO L125 PetriNetUnfolderBase]: For 378704/378719 co-relation queries the response was YES. [2024-06-27 22:43:33,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92359 conditions, 11652 events. 7699/11652 cut-off events. For 378704/378719 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 69038 event pairs, 1950 based on Foata normal form. 14/11428 useless extension candidates. Maximal degree in co-relation 92256. Up to 10172 conditions per place. [2024-06-27 22:43:33,571 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 380 selfloop transitions, 137 changer transitions 0/523 dead transitions. [2024-06-27 22:43:33,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 523 transitions, 8923 flow [2024-06-27 22:43:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:43:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:43:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-06-27 22:43:33,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484375 [2024-06-27 22:43:33,572 INFO L175 Difference]: Start difference. First operand has 217 places, 406 transitions, 6590 flow. Second operand 8 states and 186 transitions. [2024-06-27 22:43:33,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 523 transitions, 8923 flow [2024-06-27 22:43:34,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 523 transitions, 8608 flow, removed 71 selfloop flow, removed 4 redundant places. [2024-06-27 22:43:34,632 INFO L231 Difference]: Finished difference. Result has 224 places, 459 transitions, 7796 flow [2024-06-27 22:43:34,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6316, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7796, PETRI_PLACES=224, PETRI_TRANSITIONS=459} [2024-06-27 22:43:34,632 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 170 predicate places. [2024-06-27 22:43:34,632 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 459 transitions, 7796 flow [2024-06-27 22:43:34,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:34,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:34,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:34,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:43:34,633 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:34,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1876405167, now seen corresponding path program 1 times [2024-06-27 22:43:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:34,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416445465] [2024-06-27 22:43:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:42,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416445465] [2024-06-27 22:43:42,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416445465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:42,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:42,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:43:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409631912] [2024-06-27 22:43:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:42,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:43:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:42,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:43:42,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:43:42,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:43:42,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 459 transitions, 7796 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:42,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:42,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:43:42,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:46,457 INFO L124 PetriNetUnfolderBase]: 7749/11892 cut-off events. [2024-06-27 22:43:46,457 INFO L125 PetriNetUnfolderBase]: For 395578/395593 co-relation queries the response was YES. [2024-06-27 22:43:46,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94694 conditions, 11892 events. 7749/11892 cut-off events. For 395578/395593 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 71413 event pairs, 1888 based on Foata normal form. 16/11615 useless extension candidates. Maximal degree in co-relation 94586. Up to 10452 conditions per place. [2024-06-27 22:43:46,612 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 417 selfloop transitions, 89 changer transitions 0/512 dead transitions. [2024-06-27 22:43:46,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 512 transitions, 9136 flow [2024-06-27 22:43:46,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:43:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:43:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 22:43:46,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2024-06-27 22:43:46,613 INFO L175 Difference]: Start difference. First operand has 224 places, 459 transitions, 7796 flow. Second operand 8 states and 177 transitions. [2024-06-27 22:43:46,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 512 transitions, 9136 flow [2024-06-27 22:43:47,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 512 transitions, 8973 flow, removed 72 selfloop flow, removed 2 redundant places. [2024-06-27 22:43:47,972 INFO L231 Difference]: Finished difference. Result has 230 places, 461 transitions, 7892 flow [2024-06-27 22:43:47,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7643, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7892, PETRI_PLACES=230, PETRI_TRANSITIONS=461} [2024-06-27 22:43:47,973 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 176 predicate places. [2024-06-27 22:43:47,973 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 461 transitions, 7892 flow [2024-06-27 22:43:47,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:47,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:47,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:43:47,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:43:47,973 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:43:47,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1883739705, now seen corresponding path program 5 times [2024-06-27 22:43:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445154332] [2024-06-27 22:43:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:54,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445154332] [2024-06-27 22:43:54,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445154332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:54,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:43:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466792700] [2024-06-27 22:43:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:54,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:43:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:54,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:43:54,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:43:54,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:43:54,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 461 transitions, 7892 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:54,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:54,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:43:54,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:58,502 INFO L124 PetriNetUnfolderBase]: 8010/11998 cut-off events. [2024-06-27 22:43:58,503 INFO L125 PetriNetUnfolderBase]: For 431884/431899 co-relation queries the response was YES. [2024-06-27 22:43:58,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98868 conditions, 11998 events. 8010/11998 cut-off events. For 431884/431899 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 70348 event pairs, 1778 based on Foata normal form. 36/11832 useless extension candidates. Maximal degree in co-relation 98758. Up to 9576 conditions per place. [2024-06-27 22:43:58,661 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 354 selfloop transitions, 190 changer transitions 0/550 dead transitions. [2024-06-27 22:43:58,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 550 transitions, 9741 flow [2024-06-27 22:43:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:43:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:43:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2024-06-27 22:43:58,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5755208333333334 [2024-06-27 22:43:58,662 INFO L175 Difference]: Start difference. First operand has 230 places, 461 transitions, 7892 flow. Second operand 8 states and 221 transitions. [2024-06-27 22:43:58,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 550 transitions, 9741 flow [2024-06-27 22:44:00,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 550 transitions, 9489 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:00,077 INFO L231 Difference]: Finished difference. Result has 235 places, 477 transitions, 8550 flow [2024-06-27 22:44:00,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7642, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8550, PETRI_PLACES=235, PETRI_TRANSITIONS=477} [2024-06-27 22:44:00,078 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 181 predicate places. [2024-06-27 22:44:00,078 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 477 transitions, 8550 flow [2024-06-27 22:44:00,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:00,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:00,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:00,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:44:00,079 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:00,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash 530761929, now seen corresponding path program 2 times [2024-06-27 22:44:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:00,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914404322] [2024-06-27 22:44:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914404322] [2024-06-27 22:44:07,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914404322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:07,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:44:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125581365] [2024-06-27 22:44:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:07,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:44:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:07,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:44:07,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:44:07,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:44:07,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 477 transitions, 8550 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:07,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:07,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:44:07,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:11,685 INFO L124 PetriNetUnfolderBase]: 8002/12247 cut-off events. [2024-06-27 22:44:11,685 INFO L125 PetriNetUnfolderBase]: For 445843/445858 co-relation queries the response was YES. [2024-06-27 22:44:11,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103982 conditions, 12247 events. 8002/12247 cut-off events. For 445843/445858 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 73652 event pairs, 1737 based on Foata normal form. 16/11974 useless extension candidates. Maximal degree in co-relation 103869. Up to 10669 conditions per place. [2024-06-27 22:44:11,854 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 436 selfloop transitions, 86 changer transitions 0/528 dead transitions. [2024-06-27 22:44:11,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 528 transitions, 9882 flow [2024-06-27 22:44:11,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:44:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:44:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-06-27 22:44:11,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 22:44:11,855 INFO L175 Difference]: Start difference. First operand has 235 places, 477 transitions, 8550 flow. Second operand 8 states and 176 transitions. [2024-06-27 22:44:11,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 528 transitions, 9882 flow [2024-06-27 22:44:13,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 528 transitions, 9801 flow, removed 32 selfloop flow, removed 1 redundant places. [2024-06-27 22:44:13,393 INFO L231 Difference]: Finished difference. Result has 242 places, 479 transitions, 8720 flow [2024-06-27 22:44:13,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8469, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8720, PETRI_PLACES=242, PETRI_TRANSITIONS=479} [2024-06-27 22:44:13,394 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 188 predicate places. [2024-06-27 22:44:13,394 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 479 transitions, 8720 flow [2024-06-27 22:44:13,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:13,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:13,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:13,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:44:13,395 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:13,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1374836037, now seen corresponding path program 1 times [2024-06-27 22:44:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824524087] [2024-06-27 22:44:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:20,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824524087] [2024-06-27 22:44:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824524087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:44:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702400365] [2024-06-27 22:44:20,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:20,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:44:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:20,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:44:20,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:44:20,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:44:20,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 479 transitions, 8720 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:20,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:20,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:44:20,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:24,983 INFO L124 PetriNetUnfolderBase]: 8570/13157 cut-off events. [2024-06-27 22:44:24,984 INFO L125 PetriNetUnfolderBase]: For 550710/550761 co-relation queries the response was YES. [2024-06-27 22:44:25,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114524 conditions, 13157 events. 8570/13157 cut-off events. For 550710/550761 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 80442 event pairs, 1904 based on Foata normal form. 56/12908 useless extension candidates. Maximal degree in co-relation 114408. Up to 10294 conditions per place. [2024-06-27 22:44:25,122 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 457 selfloop transitions, 128 changer transitions 0/591 dead transitions. [2024-06-27 22:44:25,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 591 transitions, 11132 flow [2024-06-27 22:44:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:44:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:44:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions. [2024-06-27 22:44:25,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-06-27 22:44:25,123 INFO L175 Difference]: Start difference. First operand has 242 places, 479 transitions, 8720 flow. Second operand 8 states and 220 transitions. [2024-06-27 22:44:25,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 591 transitions, 11132 flow [2024-06-27 22:44:26,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 591 transitions, 10913 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:26,386 INFO L231 Difference]: Finished difference. Result has 247 places, 500 transitions, 9336 flow [2024-06-27 22:44:26,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8501, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9336, PETRI_PLACES=247, PETRI_TRANSITIONS=500} [2024-06-27 22:44:26,386 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 193 predicate places. [2024-06-27 22:44:26,387 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 500 transitions, 9336 flow [2024-06-27 22:44:26,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:26,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:26,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:26,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:44:26,387 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:26,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:26,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1382082595, now seen corresponding path program 2 times [2024-06-27 22:44:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:26,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163124688] [2024-06-27 22:44:26,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:26,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:33,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163124688] [2024-06-27 22:44:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163124688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:33,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:33,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:44:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048511358] [2024-06-27 22:44:33,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:33,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:44:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:44:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:44:33,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:44:33,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 500 transitions, 9336 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:33,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:33,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:44:33,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:38,145 INFO L124 PetriNetUnfolderBase]: 8812/13444 cut-off events. [2024-06-27 22:44:38,145 INFO L125 PetriNetUnfolderBase]: For 609455/609506 co-relation queries the response was YES. [2024-06-27 22:44:38,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120930 conditions, 13444 events. 8812/13444 cut-off events. For 609455/609506 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 82163 event pairs, 2353 based on Foata normal form. 60/13226 useless extension candidates. Maximal degree in co-relation 120811. Up to 11432 conditions per place. [2024-06-27 22:44:38,318 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 458 selfloop transitions, 124 changer transitions 0/588 dead transitions. [2024-06-27 22:44:38,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 588 transitions, 11260 flow [2024-06-27 22:44:38,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:44:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:44:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-06-27 22:44:38,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-27 22:44:38,320 INFO L175 Difference]: Start difference. First operand has 247 places, 500 transitions, 9336 flow. Second operand 9 states and 224 transitions. [2024-06-27 22:44:38,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 588 transitions, 11260 flow [2024-06-27 22:44:39,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 588 transitions, 11066 flow, removed 78 selfloop flow, removed 1 redundant places. [2024-06-27 22:44:39,951 INFO L231 Difference]: Finished difference. Result has 255 places, 504 transitions, 9572 flow [2024-06-27 22:44:39,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9164, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9572, PETRI_PLACES=255, PETRI_TRANSITIONS=504} [2024-06-27 22:44:39,952 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 201 predicate places. [2024-06-27 22:44:39,952 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 504 transitions, 9572 flow [2024-06-27 22:44:39,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:39,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:39,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:39,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:44:39,953 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:39,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1376709987, now seen corresponding path program 3 times [2024-06-27 22:44:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:39,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079868368] [2024-06-27 22:44:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:47,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:47,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079868368] [2024-06-27 22:44:47,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079868368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:47,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:47,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:44:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318045307] [2024-06-27 22:44:47,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:47,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:44:47,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:47,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:44:47,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:44:47,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:44:47,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 504 transitions, 9572 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:47,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:47,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:44:47,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:52,234 INFO L124 PetriNetUnfolderBase]: 8849/13469 cut-off events. [2024-06-27 22:44:52,235 INFO L125 PetriNetUnfolderBase]: For 596675/596726 co-relation queries the response was YES. [2024-06-27 22:44:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121338 conditions, 13469 events. 8849/13469 cut-off events. For 596675/596726 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 82289 event pairs, 2308 based on Foata normal form. 44/13245 useless extension candidates. Maximal degree in co-relation 121216. Up to 11851 conditions per place. [2024-06-27 22:44:52,431 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 461 selfloop transitions, 110 changer transitions 0/577 dead transitions. [2024-06-27 22:44:52,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 577 transitions, 11152 flow [2024-06-27 22:44:52,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:44:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:44:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-06-27 22:44:52,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2024-06-27 22:44:52,433 INFO L175 Difference]: Start difference. First operand has 255 places, 504 transitions, 9572 flow. Second operand 8 states and 202 transitions. [2024-06-27 22:44:52,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 577 transitions, 11152 flow [2024-06-27 22:44:54,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 577 transitions, 10812 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:54,064 INFO L231 Difference]: Finished difference. Result has 260 places, 514 transitions, 9783 flow [2024-06-27 22:44:54,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9255, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9783, PETRI_PLACES=260, PETRI_TRANSITIONS=514} [2024-06-27 22:44:54,065 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 206 predicate places. [2024-06-27 22:44:54,065 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 514 transitions, 9783 flow [2024-06-27 22:44:54,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:54,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:54,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:44:54,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:44:54,066 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:44:54,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1463405517, now seen corresponding path program 4 times [2024-06-27 22:44:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649372534] [2024-06-27 22:44:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649372534] [2024-06-27 22:45:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649372534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:04,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:04,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:45:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079361257] [2024-06-27 22:45:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:04,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:45:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:04,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:45:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:45:04,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:45:04,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 514 transitions, 9783 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:04,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:04,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:45:04,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:09,297 INFO L124 PetriNetUnfolderBase]: 9075/13797 cut-off events. [2024-06-27 22:45:09,297 INFO L125 PetriNetUnfolderBase]: For 637945/637996 co-relation queries the response was YES. [2024-06-27 22:45:09,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125541 conditions, 13797 events. 9075/13797 cut-off events. For 637945/637996 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 84506 event pairs, 2210 based on Foata normal form. 60/13595 useless extension candidates. Maximal degree in co-relation 125416. Up to 11978 conditions per place. [2024-06-27 22:45:09,490 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 493 selfloop transitions, 93 changer transitions 0/592 dead transitions. [2024-06-27 22:45:09,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 592 transitions, 11473 flow [2024-06-27 22:45:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:45:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:45:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-06-27 22:45:09,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2024-06-27 22:45:09,496 INFO L175 Difference]: Start difference. First operand has 260 places, 514 transitions, 9783 flow. Second operand 9 states and 220 transitions. [2024-06-27 22:45:09,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 592 transitions, 11473 flow [2024-06-27 22:45:11,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 592 transitions, 11222 flow, removed 86 selfloop flow, removed 2 redundant places. [2024-06-27 22:45:11,270 INFO L231 Difference]: Finished difference. Result has 267 places, 515 transitions, 9783 flow [2024-06-27 22:45:11,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9532, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9783, PETRI_PLACES=267, PETRI_TRANSITIONS=515} [2024-06-27 22:45:11,270 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 213 predicate places. [2024-06-27 22:45:11,271 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 515 transitions, 9783 flow [2024-06-27 22:45:11,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:11,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:11,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:11,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:45:11,271 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:11,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:11,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1463401797, now seen corresponding path program 5 times [2024-06-27 22:45:11,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:11,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065692819] [2024-06-27 22:45:11,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:11,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:22,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:22,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065692819] [2024-06-27 22:45:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065692819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:22,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:45:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650757284] [2024-06-27 22:45:22,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:22,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:45:22,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:22,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:45:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:45:22,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:45:22,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 515 transitions, 9783 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:22,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:22,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:45:22,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:27,333 INFO L124 PetriNetUnfolderBase]: 9580/14603 cut-off events. [2024-06-27 22:45:27,333 INFO L125 PetriNetUnfolderBase]: For 725502/725553 co-relation queries the response was YES. [2024-06-27 22:45:27,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135168 conditions, 14603 events. 9580/14603 cut-off events. For 725502/725553 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 90606 event pairs, 2247 based on Foata normal form. 56/14385 useless extension candidates. Maximal degree in co-relation 135040. Up to 12157 conditions per place. [2024-06-27 22:45:27,515 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 506 selfloop transitions, 99 changer transitions 0/611 dead transitions. [2024-06-27 22:45:27,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 611 transitions, 11972 flow [2024-06-27 22:45:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:45:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:45:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-06-27 22:45:27,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-27 22:45:27,517 INFO L175 Difference]: Start difference. First operand has 267 places, 515 transitions, 9783 flow. Second operand 9 states and 224 transitions. [2024-06-27 22:45:27,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 611 transitions, 11972 flow [2024-06-27 22:45:29,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 611 transitions, 11720 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-27 22:45:29,650 INFO L231 Difference]: Finished difference. Result has 271 places, 532 transitions, 10202 flow [2024-06-27 22:45:29,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9574, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10202, PETRI_PLACES=271, PETRI_TRANSITIONS=532} [2024-06-27 22:45:29,650 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 217 predicate places. [2024-06-27 22:45:29,651 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 532 transitions, 10202 flow [2024-06-27 22:45:29,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:29,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:29,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:29,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:45:29,651 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:29,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:29,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2130359491, now seen corresponding path program 1 times [2024-06-27 22:45:29,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:29,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929180960] [2024-06-27 22:45:29,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:29,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:40,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:40,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929180960] [2024-06-27 22:45:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929180960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:40,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:40,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:45:40,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344330471] [2024-06-27 22:45:40,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:40,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:45:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:40,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:45:40,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:45:40,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:45:40,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 532 transitions, 10202 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:40,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:40,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:45:40,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:45,058 INFO L124 PetriNetUnfolderBase]: 9630/14806 cut-off events. [2024-06-27 22:45:45,058 INFO L125 PetriNetUnfolderBase]: For 723999/724050 co-relation queries the response was YES. [2024-06-27 22:45:45,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136213 conditions, 14806 events. 9630/14806 cut-off events. For 723999/724050 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 93230 event pairs, 2391 based on Foata normal form. 44/14533 useless extension candidates. Maximal degree in co-relation 136082. Up to 13205 conditions per place. [2024-06-27 22:45:45,262 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 499 selfloop transitions, 87 changer transitions 0/592 dead transitions. [2024-06-27 22:45:45,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 592 transitions, 11680 flow [2024-06-27 22:45:45,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:45:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:45:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-06-27 22:45:45,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-27 22:45:45,264 INFO L175 Difference]: Start difference. First operand has 271 places, 532 transitions, 10202 flow. Second operand 8 states and 190 transitions. [2024-06-27 22:45:45,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 592 transitions, 11680 flow [2024-06-27 22:45:47,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 592 transitions, 11473 flow, removed 59 selfloop flow, removed 3 redundant places. [2024-06-27 22:45:47,492 INFO L231 Difference]: Finished difference. Result has 276 places, 534 transitions, 10270 flow [2024-06-27 22:45:47,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9995, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10270, PETRI_PLACES=276, PETRI_TRANSITIONS=534} [2024-06-27 22:45:47,492 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 222 predicate places. [2024-06-27 22:45:47,493 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 534 transitions, 10270 flow [2024-06-27 22:45:47,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:47,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:47,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:45:47,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:45:47,493 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:45:47,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1463549667, now seen corresponding path program 6 times [2024-06-27 22:45:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:47,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349497638] [2024-06-27 22:45:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:59,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:59,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349497638] [2024-06-27 22:45:59,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349497638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:59,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:59,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:45:59,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308808737] [2024-06-27 22:45:59,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:59,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:45:59,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:59,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:45:59,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:45:59,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:45:59,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 534 transitions, 10270 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:59,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:59,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:45:59,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:04,827 INFO L124 PetriNetUnfolderBase]: 9653/14809 cut-off events. [2024-06-27 22:46:04,828 INFO L125 PetriNetUnfolderBase]: For 710786/710837 co-relation queries the response was YES. [2024-06-27 22:46:04,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135076 conditions, 14809 events. 9653/14809 cut-off events. For 710786/710837 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 92933 event pairs, 2418 based on Foata normal form. 60/14562 useless extension candidates. Maximal degree in co-relation 134943. Up to 12849 conditions per place. [2024-06-27 22:46:05,034 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 510 selfloop transitions, 93 changer transitions 0/609 dead transitions. [2024-06-27 22:46:05,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 609 transitions, 11900 flow [2024-06-27 22:46:05,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-06-27 22:46:05,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023148148148148 [2024-06-27 22:46:05,035 INFO L175 Difference]: Start difference. First operand has 276 places, 534 transitions, 10270 flow. Second operand 9 states and 217 transitions. [2024-06-27 22:46:05,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 609 transitions, 11900 flow [2024-06-27 22:46:07,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 609 transitions, 11631 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:07,021 INFO L231 Difference]: Finished difference. Result has 279 places, 535 transitions, 10261 flow [2024-06-27 22:46:07,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10001, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10261, PETRI_PLACES=279, PETRI_TRANSITIONS=535} [2024-06-27 22:46:07,022 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 225 predicate places. [2024-06-27 22:46:07,022 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 535 transitions, 10261 flow [2024-06-27 22:46:07,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:07,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:07,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:07,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:46:07,023 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:07,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 550169105, now seen corresponding path program 2 times [2024-06-27 22:46:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317066995] [2024-06-27 22:46:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317066995] [2024-06-27 22:46:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317066995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:14,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:14,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593366216] [2024-06-27 22:46:14,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:14,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:14,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:14,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:46:14,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 535 transitions, 10261 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:14,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:14,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:46:14,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:19,089 INFO L124 PetriNetUnfolderBase]: 9703/14848 cut-off events. [2024-06-27 22:46:19,089 INFO L125 PetriNetUnfolderBase]: For 694555/694570 co-relation queries the response was YES. [2024-06-27 22:46:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135357 conditions, 14848 events. 9703/14848 cut-off events. For 694555/694570 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 92830 event pairs, 2335 based on Foata normal form. 16/14567 useless extension candidates. Maximal degree in co-relation 135223. Up to 13503 conditions per place. [2024-06-27 22:46:19,320 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 527 selfloop transitions, 70 changer transitions 0/603 dead transitions. [2024-06-27 22:46:19,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 603 transitions, 12089 flow [2024-06-27 22:46:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-06-27 22:46:19,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44675925925925924 [2024-06-27 22:46:19,321 INFO L175 Difference]: Start difference. First operand has 279 places, 535 transitions, 10261 flow. Second operand 9 states and 193 transitions. [2024-06-27 22:46:19,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 603 transitions, 12089 flow [2024-06-27 22:46:21,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 603 transitions, 11871 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:21,775 INFO L231 Difference]: Finished difference. Result has 284 places, 555 transitions, 10774 flow [2024-06-27 22:46:21,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10043, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10774, PETRI_PLACES=284, PETRI_TRANSITIONS=555} [2024-06-27 22:46:21,775 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 230 predicate places. [2024-06-27 22:46:21,776 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 555 transitions, 10774 flow [2024-06-27 22:46:21,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:21,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:21,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:21,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:46:21,776 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:21,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash 748178566, now seen corresponding path program 1 times [2024-06-27 22:46:21,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:21,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949762175] [2024-06-27 22:46:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:29,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-27 22:46:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949762175] [2024-06-27 22:46:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949762175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:29,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287051709] [2024-06-27 22:46:29,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:29,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:29,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:29,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:46:29,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 555 transitions, 10774 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:29,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:29,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:46:29,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:34,378 INFO L124 PetriNetUnfolderBase]: 9774/14967 cut-off events. [2024-06-27 22:46:34,378 INFO L125 PetriNetUnfolderBase]: For 710723/710738 co-relation queries the response was YES. [2024-06-27 22:46:34,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137313 conditions, 14967 events. 9774/14967 cut-off events. For 710723/710738 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 93878 event pairs, 2494 based on Foata normal form. 14/14677 useless extension candidates. Maximal degree in co-relation 137175. Up to 13528 conditions per place. [2024-06-27 22:46:34,571 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 514 selfloop transitions, 111 changer transitions 0/631 dead transitions. [2024-06-27 22:46:34,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 631 transitions, 12662 flow [2024-06-27 22:46:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-06-27 22:46:34,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 22:46:34,572 INFO L175 Difference]: Start difference. First operand has 284 places, 555 transitions, 10774 flow. Second operand 9 states and 200 transitions. [2024-06-27 22:46:34,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 631 transitions, 12662 flow [2024-06-27 22:46:36,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 631 transitions, 12453 flow, removed 93 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:36,888 INFO L231 Difference]: Finished difference. Result has 293 places, 578 transitions, 11430 flow [2024-06-27 22:46:36,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10565, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11430, PETRI_PLACES=293, PETRI_TRANSITIONS=578} [2024-06-27 22:46:36,888 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 239 predicate places. [2024-06-27 22:46:36,888 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 578 transitions, 11430 flow [2024-06-27 22:46:36,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:36,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:36,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:36,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:46:36,889 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:36,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1057053819, now seen corresponding path program 3 times [2024-06-27 22:46:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633003844] [2024-06-27 22:46:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633003844] [2024-06-27 22:46:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633003844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:44,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212083027] [2024-06-27 22:46:44,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:44,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:44,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:44,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:44,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:44,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:46:44,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 578 transitions, 11430 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:44,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:44,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:46:44,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:49,612 INFO L124 PetriNetUnfolderBase]: 9824/15194 cut-off events. [2024-06-27 22:46:49,612 INFO L125 PetriNetUnfolderBase]: For 734953/734968 co-relation queries the response was YES. [2024-06-27 22:46:49,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139512 conditions, 15194 events. 9824/15194 cut-off events. For 734953/734968 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 96326 event pairs, 2393 based on Foata normal form. 16/14855 useless extension candidates. Maximal degree in co-relation 139369. Up to 13462 conditions per place. [2024-06-27 22:46:49,810 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 494 selfloop transitions, 139 changer transitions 0/639 dead transitions. [2024-06-27 22:46:49,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 639 transitions, 13056 flow [2024-06-27 22:46:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-06-27 22:46:49,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-06-27 22:46:49,812 INFO L175 Difference]: Start difference. First operand has 293 places, 578 transitions, 11430 flow. Second operand 9 states and 201 transitions. [2024-06-27 22:46:49,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 639 transitions, 13056 flow [2024-06-27 22:46:52,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 639 transitions, 12835 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:52,112 INFO L231 Difference]: Finished difference. Result has 298 places, 581 transitions, 11636 flow [2024-06-27 22:46:52,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11209, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11636, PETRI_PLACES=298, PETRI_TRANSITIONS=581} [2024-06-27 22:46:52,113 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 244 predicate places. [2024-06-27 22:46:52,113 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 581 transitions, 11636 flow [2024-06-27 22:46:52,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:52,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:52,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:52,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:46:52,113 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:52,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:52,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2010819546, now seen corresponding path program 2 times [2024-06-27 22:46:52,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:52,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072833416] [2024-06-27 22:46:52,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:52,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:59,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:59,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072833416] [2024-06-27 22:46:59,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072833416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:59,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:59,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:46:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785061799] [2024-06-27 22:46:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:59,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:46:59,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:59,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:46:59,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:46:59,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:46:59,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 581 transitions, 11636 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:59,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:59,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:46:59,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:05,039 INFO L124 PetriNetUnfolderBase]: 9843/15220 cut-off events. [2024-06-27 22:47:05,039 INFO L125 PetriNetUnfolderBase]: For 759210/759225 co-relation queries the response was YES. [2024-06-27 22:47:05,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140705 conditions, 15220 events. 9843/15220 cut-off events. For 759210/759225 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 96387 event pairs, 2388 based on Foata normal form. 14/14879 useless extension candidates. Maximal degree in co-relation 140561. Up to 13471 conditions per place. [2024-06-27 22:47:05,284 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 487 selfloop transitions, 153 changer transitions 0/646 dead transitions. [2024-06-27 22:47:05,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 646 transitions, 13392 flow [2024-06-27 22:47:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:47:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:47:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 22:47:05,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2024-06-27 22:47:05,285 INFO L175 Difference]: Start difference. First operand has 298 places, 581 transitions, 11636 flow. Second operand 8 states and 191 transitions. [2024-06-27 22:47:05,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 646 transitions, 13392 flow [2024-06-27 22:47:07,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 646 transitions, 12995 flow, removed 63 selfloop flow, removed 7 redundant places. [2024-06-27 22:47:07,822 INFO L231 Difference]: Finished difference. Result has 299 places, 589 transitions, 11840 flow [2024-06-27 22:47:07,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11239, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11840, PETRI_PLACES=299, PETRI_TRANSITIONS=589} [2024-06-27 22:47:07,822 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 245 predicate places. [2024-06-27 22:47:07,822 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 589 transitions, 11840 flow [2024-06-27 22:47:07,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:07,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:07,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:07,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:47:07,823 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:07,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2010825126, now seen corresponding path program 3 times [2024-06-27 22:47:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:07,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138983911] [2024-06-27 22:47:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:07,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:15,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138983911] [2024-06-27 22:47:15,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138983911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:15,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:15,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432190575] [2024-06-27 22:47:15,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:15,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:15,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:15,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:47:15,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 589 transitions, 11840 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:15,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:15,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:47:15,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:20,756 INFO L124 PetriNetUnfolderBase]: 9890/15120 cut-off events. [2024-06-27 22:47:20,757 INFO L125 PetriNetUnfolderBase]: For 781079/781094 co-relation queries the response was YES. [2024-06-27 22:47:21,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142331 conditions, 15120 events. 9890/15120 cut-off events. For 781079/781094 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 94612 event pairs, 2530 based on Foata normal form. 14/14834 useless extension candidates. Maximal degree in co-relation 142186. Up to 13862 conditions per place. [2024-06-27 22:47:21,266 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 573 selfloop transitions, 68 changer transitions 0/647 dead transitions. [2024-06-27 22:47:21,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 647 transitions, 13670 flow [2024-06-27 22:47:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:47:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:47:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-06-27 22:47:21,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-06-27 22:47:21,267 INFO L175 Difference]: Start difference. First operand has 299 places, 589 transitions, 11840 flow. Second operand 7 states and 172 transitions. [2024-06-27 22:47:21,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 647 transitions, 13670 flow [2024-06-27 22:47:24,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 647 transitions, 13096 flow, removed 145 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:24,341 INFO L231 Difference]: Finished difference. Result has 300 places, 598 transitions, 11785 flow [2024-06-27 22:47:24,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11371, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11785, PETRI_PLACES=300, PETRI_TRANSITIONS=598} [2024-06-27 22:47:24,341 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 246 predicate places. [2024-06-27 22:47:24,341 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 598 transitions, 11785 flow [2024-06-27 22:47:24,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:24,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:24,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:24,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:47:24,342 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:24,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2026233477, now seen corresponding path program 7 times [2024-06-27 22:47:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:24,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902789993] [2024-06-27 22:47:24,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902789993] [2024-06-27 22:47:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902789993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137766723] [2024-06-27 22:47:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:31,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:31,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:31,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:47:31,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 598 transitions, 11785 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:31,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:31,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:47:31,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:36,789 INFO L124 PetriNetUnfolderBase]: 10203/15501 cut-off events. [2024-06-27 22:47:36,789 INFO L125 PetriNetUnfolderBase]: For 865966/865981 co-relation queries the response was YES. [2024-06-27 22:47:36,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149060 conditions, 15501 events. 10203/15501 cut-off events. For 865966/865981 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 96596 event pairs, 2278 based on Foata normal form. 16/15247 useless extension candidates. Maximal degree in co-relation 148915. Up to 12107 conditions per place. [2024-06-27 22:47:37,003 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 443 selfloop transitions, 242 changer transitions 0/691 dead transitions. [2024-06-27 22:47:37,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 691 transitions, 14489 flow [2024-06-27 22:47:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:47:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:47:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions. [2024-06-27 22:47:37,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2024-06-27 22:47:37,005 INFO L175 Difference]: Start difference. First operand has 300 places, 598 transitions, 11785 flow. Second operand 8 states and 214 transitions. [2024-06-27 22:47:37,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 691 transitions, 14489 flow [2024-06-27 22:47:39,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 691 transitions, 14263 flow, removed 66 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:39,738 INFO L231 Difference]: Finished difference. Result has 306 places, 620 transitions, 12950 flow [2024-06-27 22:47:39,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11559, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12950, PETRI_PLACES=306, PETRI_TRANSITIONS=620} [2024-06-27 22:47:39,739 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 252 predicate places. [2024-06-27 22:47:39,739 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 620 transitions, 12950 flow [2024-06-27 22:47:39,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:39,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:39,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:39,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:47:39,739 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:39,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 742464646, now seen corresponding path program 4 times [2024-06-27 22:47:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303474712] [2024-06-27 22:47:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:47,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:47,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303474712] [2024-06-27 22:47:47,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303474712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:47,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:47:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675353336] [2024-06-27 22:47:47,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:47,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:47:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:47:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:47:47,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:47:47,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 620 transitions, 12950 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:47,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:47,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:47:47,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:53,628 INFO L124 PetriNetUnfolderBase]: 10238/15663 cut-off events. [2024-06-27 22:47:53,629 INFO L125 PetriNetUnfolderBase]: For 924853/924868 co-relation queries the response was YES. [2024-06-27 22:47:53,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155708 conditions, 15663 events. 10238/15663 cut-off events. For 924853/924868 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 98674 event pairs, 2518 based on Foata normal form. 14/15369 useless extension candidates. Maximal degree in co-relation 155560. Up to 13610 conditions per place. [2024-06-27 22:47:53,852 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 494 selfloop transitions, 197 changer transitions 0/697 dead transitions. [2024-06-27 22:47:53,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 697 transitions, 15365 flow [2024-06-27 22:47:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:47:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:47:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 22:47:53,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:47:53,853 INFO L175 Difference]: Start difference. First operand has 306 places, 620 transitions, 12950 flow. Second operand 8 states and 192 transitions. [2024-06-27 22:47:53,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 697 transitions, 15365 flow [2024-06-27 22:47:57,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 697 transitions, 15077 flow, removed 115 selfloop flow, removed 2 redundant places. [2024-06-27 22:47:57,166 INFO L231 Difference]: Finished difference. Result has 314 places, 635 transitions, 13740 flow [2024-06-27 22:47:57,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12666, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13740, PETRI_PLACES=314, PETRI_TRANSITIONS=635} [2024-06-27 22:47:57,167 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 260 predicate places. [2024-06-27 22:47:57,167 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 635 transitions, 13740 flow [2024-06-27 22:47:57,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:57,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:57,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:47:57,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:47:57,167 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:57,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash 742464491, now seen corresponding path program 8 times [2024-06-27 22:47:57,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:57,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900595007] [2024-06-27 22:47:57,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:57,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:05,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:05,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900595007] [2024-06-27 22:48:05,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900595007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:05,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:05,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:05,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120808090] [2024-06-27 22:48:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:05,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:05,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-06-27 22:48:05,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 635 transitions, 13740 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:05,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:05,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-06-27 22:48:05,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:11,410 INFO L124 PetriNetUnfolderBase]: 10288/15743 cut-off events. [2024-06-27 22:48:11,410 INFO L125 PetriNetUnfolderBase]: For 955587/955602 co-relation queries the response was YES. [2024-06-27 22:48:11,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158436 conditions, 15743 events. 10288/15743 cut-off events. For 955587/955602 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 99274 event pairs, 2527 based on Foata normal form. 16/15449 useless extension candidates. Maximal degree in co-relation 158283. Up to 13788 conditions per place. [2024-06-27 22:48:11,622 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 519 selfloop transitions, 184 changer transitions 0/709 dead transitions. [2024-06-27 22:48:11,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 709 transitions, 15797 flow [2024-06-27 22:48:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 22:48:11,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:48:11,623 INFO L175 Difference]: Start difference. First operand has 314 places, 635 transitions, 13740 flow. Second operand 9 states and 216 transitions. [2024-06-27 22:48:11,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 709 transitions, 15797 flow [2024-06-27 22:48:14,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 709 transitions, 15547 flow, removed 80 selfloop flow, removed 4 redundant places. [2024-06-27 22:48:14,926 INFO L231 Difference]: Finished difference. Result has 319 places, 640 transitions, 14080 flow [2024-06-27 22:48:14,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=13494, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14080, PETRI_PLACES=319, PETRI_TRANSITIONS=640} [2024-06-27 22:48:14,927 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 265 predicate places. [2024-06-27 22:48:14,927 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 640 transitions, 14080 flow [2024-06-27 22:48:14,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:14,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:14,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:14,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:48:14,928 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:14,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash 742608641, now seen corresponding path program 9 times [2024-06-27 22:48:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:14,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202737760] [2024-06-27 22:48:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat