./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.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/mix035.oepc.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/mix035.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix035.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:19:39,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:19:39,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:19:39,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:19:39,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:19:39,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:19:39,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:19:39,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:19:39,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:19:39,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:19:39,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:19:39,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:19:39,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:19:39,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:19:39,107 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:19:39,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:19:39,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:19:39,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:19:39,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:19:39,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:19:39,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:19:39,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:19:39,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:19:39,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:19:39,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:19:39,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:19:39,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:19:39,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:19:39,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:19:39,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:19:39,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:19:39,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:19:39,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:19:39,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:19:39,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:19:39,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:19:39,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:19:39,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:19:39,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:19:39,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:19:39,122 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:19:39,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:19:39,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:19:39,125 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:19:39,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:19:39,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:19:39,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:19:39,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:19:39,326 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:19:39,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2024-06-27 22:19:40,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:19:40,496 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:19:40,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2024-06-27 22:19:40,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257ae0219/e2580ce21adf4a15a8681d58bbedf33b/FLAG332017d9a [2024-06-27 22:19:40,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/257ae0219/e2580ce21adf4a15a8681d58bbedf33b [2024-06-27 22:19:40,546 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:19:40,546 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:19:40,547 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/mix035.oepc.yml/witness.yml [2024-06-27 22:19:40,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:19:40,616 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:19:40,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:19:40,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:19:40,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:19:40,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:19:40" (1/2) ... [2024-06-27 22:19:40,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6b2251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:19:40, skipping insertion in model container [2024-06-27 22:19:40,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:19:40" (1/2) ... [2024-06-27 22:19:40,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1a40df6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:19:40, skipping insertion in model container [2024-06-27 22:19:40,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:19:40" (2/2) ... [2024-06-27 22:19:40,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6b2251 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:19:40, skipping insertion in model container [2024-06-27 22:19:40,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:19:40" (2/2) ... [2024-06-27 22:19:40,626 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:19:40,646 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:19:40,648 INFO L97 edCorrectnessWitness]: Location invariant before [L850-L850] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:19:40,648 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:19:40,648 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:19:40,649 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:19:40,649 INFO L106 edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1; [2024-06-27 22:19:40,681 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:19:40,808 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/mix035.oepc.i[945,958] [2024-06-27 22:19:40,966 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:19:40,978 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:19:41,009 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/mix035.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:19:41,176 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:19:41,206 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:19:41,207 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:19:41 WrapperNode [2024-06-27 22:19:41,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:19:41,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:19:41,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:19:41,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:19:41,214 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:19:41" (1/1) ... [2024-06-27 22:19:41,240 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:19:41" (1/1) ... [2024-06-27 22:19:41,289 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2024-06-27 22:19:41,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:19:41,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:19:41,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:19:41,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:19:41,300 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:19:41" (1/1) ... [2024-06-27 22:19:41,300 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:19:41" (1/1) ... [2024-06-27 22:19:41,306 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:19:41" (1/1) ... [2024-06-27 22:19:41,362 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:19:41,362 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:19:41" (1/1) ... [2024-06-27 22:19:41,362 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:19:41" (1/1) ... [2024-06-27 22:19:41,383 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:19:41" (1/1) ... [2024-06-27 22:19:41,385 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:19:41" (1/1) ... [2024-06-27 22:19:41,394 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:19:41" (1/1) ... [2024-06-27 22:19:41,396 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:19:41" (1/1) ... [2024-06-27 22:19:41,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:19:41,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:19:41,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:19:41,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:19:41,410 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:19:41" (1/1) ... [2024-06-27 22:19:41,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:19:41,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:19:41,438 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:19:41,445 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:19:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:19:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:19:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:19:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:19:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:19:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:19:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:19:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:19:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:19:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:19:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:19:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:19:41,472 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:19:41,604 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:19:41,606 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:19:42,175 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:19:42,176 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:19:42,327 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:19:42,328 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:19:42,328 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:19:42 BoogieIcfgContainer [2024-06-27 22:19:42,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:19:42,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:19:42,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:19:42,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:19:42,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:19:40" (1/4) ... [2024-06-27 22:19:42,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eaa792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:19:42, skipping insertion in model container [2024-06-27 22:19:42,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:19:40" (2/4) ... [2024-06-27 22:19:42,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eaa792 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:19:42, skipping insertion in model container [2024-06-27 22:19:42,335 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:19:41" (3/4) ... [2024-06-27 22:19:42,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31eaa792 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:19:42, skipping insertion in model container [2024-06-27 22:19:42,337 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:19:42" (4/4) ... [2024-06-27 22:19:42,338 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035.oepc.i [2024-06-27 22:19:42,351 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:19:42,351 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:19:42,351 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:19:42,401 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:19:42,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:19:42,465 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-06-27 22:19:42,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:19:42,468 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 71 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:19:42,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow [2024-06-27 22:19:42,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow [2024-06-27 22:19:42,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:19:42,490 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;@342ae124, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:19:42,491 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:19:42,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:19:42,496 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:19:42,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:19:42,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:42,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:19:42,497 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:19:42,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash 363555772, now seen corresponding path program 1 times [2024-06-27 22:19:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:42,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848637192] [2024-06-27 22:19:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:42,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:44,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848637192] [2024-06-27 22:19:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848637192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:44,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:19:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235073596] [2024-06-27 22:19:44,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:44,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:19:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:44,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:19:44,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:19:44,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:19:44,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:19:44,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:44,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:19:44,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:45,091 INFO L124 PetriNetUnfolderBase]: 3630/5914 cut-off events. [2024-06-27 22:19:45,091 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-27 22:19:45,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11216 conditions, 5914 events. 3630/5914 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 38049 event pairs, 2976 based on Foata normal form. 180/5588 useless extension candidates. Maximal degree in co-relation 11204. Up to 5215 conditions per place. [2024-06-27 22:19:45,130 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 41 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2024-06-27 22:19:45,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 221 flow [2024-06-27 22:19:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:19:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:19:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-06-27 22:19:45,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-27 22:19:45,145 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 99 transitions. [2024-06-27 22:19:45,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 221 flow [2024-06-27 22:19:45,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:19:45,153 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 126 flow [2024-06-27 22:19:45,155 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=126, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-27 22:19:45,158 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2024-06-27 22:19:45,158 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 126 flow [2024-06-27 22:19:45,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:19:45,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:45,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:45,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:19:45,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:45,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1484783226, now seen corresponding path program 1 times [2024-06-27 22:19:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:45,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67603305] [2024-06-27 22:19:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:46,562 INFO 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:19:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67603305] [2024-06-27 22:19:46,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67603305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:46,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:46,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:19:46,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168712156] [2024-06-27 22:19:46,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:46,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:19:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:46,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:19:46,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:19:46,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-06-27 22:19:46,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:46,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:46,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-06-27 22:19:46,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:47,282 INFO L124 PetriNetUnfolderBase]: 3632/5928 cut-off events. [2024-06-27 22:19:47,282 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2024-06-27 22:19:47,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12526 conditions, 5928 events. 3632/5928 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 38159 event pairs, 2326 based on Foata normal form. 3/5429 useless extension candidates. Maximal degree in co-relation 12514. Up to 5200 conditions per place. [2024-06-27 22:19:47,312 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 51 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-06-27 22:19:47,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 319 flow [2024-06-27 22:19:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:19:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:19:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-06-27 22:19:47,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-06-27 22:19:47,314 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 126 flow. Second operand 4 states and 124 transitions. [2024-06-27 22:19:47,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 319 flow [2024-06-27 22:19:47,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:19:47,316 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 191 flow [2024-06-27 22:19:47,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-06-27 22:19:47,317 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2024-06-27 22:19:47,317 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 191 flow [2024-06-27 22:19:47,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:47,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:47,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:47,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:19:47,318 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:19:47,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 947578169, now seen corresponding path program 1 times [2024-06-27 22:19:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:47,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693920512] [2024-06-27 22:19:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:49,250 INFO 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:19:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693920512] [2024-06-27 22:19:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693920512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:49,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:19:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990445982] [2024-06-27 22:19:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:49,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:19:49,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:49,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:19:49,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:19:49,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-06-27 22:19:49,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:19:49,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:49,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-06-27 22:19:49,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:50,156 INFO L124 PetriNetUnfolderBase]: 4284/6550 cut-off events. [2024-06-27 22:19:50,156 INFO L125 PetriNetUnfolderBase]: For 2757/2757 co-relation queries the response was YES. [2024-06-27 22:19:50,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15633 conditions, 6550 events. 4284/6550 cut-off events. For 2757/2757 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 39929 event pairs, 1911 based on Foata normal form. 3/6172 useless extension candidates. Maximal degree in co-relation 15618. Up to 6056 conditions per place. [2024-06-27 22:19:50,191 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 72 selfloop transitions, 21 changer transitions 3/108 dead transitions. [2024-06-27 22:19:50,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 108 transitions, 549 flow [2024-06-27 22:19:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:19:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:19:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-06-27 22:19:50,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6284722222222222 [2024-06-27 22:19:50,193 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 191 flow. Second operand 6 states and 181 transitions. [2024-06-27 22:19:50,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 108 transitions, 549 flow [2024-06-27 22:19:50,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 532 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 22:19:50,197 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 309 flow [2024-06-27 22:19:50,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-06-27 22:19:50,198 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2024-06-27 22:19:50,198 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 309 flow [2024-06-27 22:19:50,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:19:50,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:50,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:50,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:19:50,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:50,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:50,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1858514291, now seen corresponding path program 1 times [2024-06-27 22:19:50,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:50,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541344377] [2024-06-27 22:19:50,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:50,255 INFO 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:19:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541344377] [2024-06-27 22:19:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541344377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:50,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:50,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:19:50,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866060109] [2024-06-27 22:19:50,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:50,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:19:50,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:50,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:19:50,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:19:50,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2024-06-27 22:19:50,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:19:50,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:50,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2024-06-27 22:19:50,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:50,567 INFO L124 PetriNetUnfolderBase]: 1340/2697 cut-off events. [2024-06-27 22:19:50,568 INFO L125 PetriNetUnfolderBase]: For 1231/1294 co-relation queries the response was YES. [2024-06-27 22:19:50,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5976 conditions, 2697 events. 1340/2697 cut-off events. For 1231/1294 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 19838 event pairs, 771 based on Foata normal form. 8/2464 useless extension candidates. Maximal degree in co-relation 5957. Up to 1752 conditions per place. [2024-06-27 22:19:50,583 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 38 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2024-06-27 22:19:50,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 427 flow [2024-06-27 22:19:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:19:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:19:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-27 22:19:50,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7847222222222222 [2024-06-27 22:19:50,585 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 309 flow. Second operand 3 states and 113 transitions. [2024-06-27 22:19:50,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 427 flow [2024-06-27 22:19:50,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 404 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 22:19:50,589 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 290 flow [2024-06-27 22:19:50,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-06-27 22:19:50,590 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2024-06-27 22:19:50,590 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 290 flow [2024-06-27 22:19:50,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:19:50,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:50,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:50,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:19:50,591 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:19:50,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -689846514, now seen corresponding path program 1 times [2024-06-27 22:19:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139636886] [2024-06-27 22:19:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:53,052 INFO 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:19:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:53,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139636886] [2024-06-27 22:19:53,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139636886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:53,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:53,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:19:53,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764549728] [2024-06-27 22:19:53,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:53,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:19:53,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:53,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:19:53,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:19:53,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-06-27 22:19:53,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:19:53,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:53,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-06-27 22:19:53,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:53,944 INFO L124 PetriNetUnfolderBase]: 3651/5547 cut-off events. [2024-06-27 22:19:53,945 INFO L125 PetriNetUnfolderBase]: For 5620/5620 co-relation queries the response was YES. [2024-06-27 22:19:53,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15013 conditions, 5547 events. 3651/5547 cut-off events. For 5620/5620 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 32156 event pairs, 1062 based on Foata normal form. 6/5462 useless extension candidates. Maximal degree in co-relation 14993. Up to 5117 conditions per place. [2024-06-27 22:19:53,981 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 76 selfloop transitions, 23 changer transitions 6/117 dead transitions. [2024-06-27 22:19:53,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 638 flow [2024-06-27 22:19:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:19:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:19:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2024-06-27 22:19:53,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6101190476190477 [2024-06-27 22:19:53,984 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 290 flow. Second operand 7 states and 205 transitions. [2024-06-27 22:19:53,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 638 flow [2024-06-27 22:19:53,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 117 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:53,993 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 345 flow [2024-06-27 22:19:53,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=345, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-27 22:19:53,995 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2024-06-27 22:19:53,999 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 345 flow [2024-06-27 22:19:53,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:19:53,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:53,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:54,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:19:54,000 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:19:54,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:54,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1415624360, now seen corresponding path program 1 times [2024-06-27 22:19:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426484234] [2024-06-27 22:19:54,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:55,485 INFO 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:19:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426484234] [2024-06-27 22:19:55,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426484234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:55,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:55,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:19:55,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814740230] [2024-06-27 22:19:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:55,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:19:55,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:19:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:19:55,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:19:55,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:55,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:55,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:19:55,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:56,468 INFO L124 PetriNetUnfolderBase]: 3635/6021 cut-off events. [2024-06-27 22:19:56,469 INFO L125 PetriNetUnfolderBase]: For 7593/7593 co-relation queries the response was YES. [2024-06-27 22:19:56,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15985 conditions, 6021 events. 3635/6021 cut-off events. For 7593/7593 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 38486 event pairs, 1536 based on Foata normal form. 4/5865 useless extension candidates. Maximal degree in co-relation 15963. Up to 5186 conditions per place. [2024-06-27 22:19:56,509 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 64 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2024-06-27 22:19:56,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 87 transitions, 573 flow [2024-06-27 22:19:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:19:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:19:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-27 22:19:56,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:19:56,511 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 345 flow. Second operand 5 states and 125 transitions. [2024-06-27 22:19:56,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 87 transitions, 573 flow [2024-06-27 22:19:56,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 87 transitions, 516 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:19:56,516 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 366 flow [2024-06-27 22:19:56,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-06-27 22:19:56,519 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2024-06-27 22:19:56,519 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 366 flow [2024-06-27 22:19:56,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:56,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:56,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:56,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:19:56,519 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:19:56,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:56,520 INFO L85 PathProgramCache]: Analyzing trace with hash 722838032, now seen corresponding path program 1 times [2024-06-27 22:19:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:56,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345253071] [2024-06-27 22:19:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:57,952 INFO 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:19:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345253071] [2024-06-27 22:19:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345253071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:57,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:57,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:19:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760332519] [2024-06-27 22:19:57,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:57,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:19:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:57,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:19:57,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:19:58,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:19:58,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:58,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:58,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:19:58,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:58,865 INFO L124 PetriNetUnfolderBase]: 3761/6189 cut-off events. [2024-06-27 22:19:58,866 INFO L125 PetriNetUnfolderBase]: For 9957/9957 co-relation queries the response was YES. [2024-06-27 22:19:58,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17428 conditions, 6189 events. 3761/6189 cut-off events. For 9957/9957 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 38829 event pairs, 1288 based on Foata normal form. 4/6002 useless extension candidates. Maximal degree in co-relation 17402. Up to 5296 conditions per place. [2024-06-27 22:19:58,900 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 81 selfloop transitions, 20 changer transitions 0/111 dead transitions. [2024-06-27 22:19:58,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 111 transitions, 746 flow [2024-06-27 22:19:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:19:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:19:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-06-27 22:19:58,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-06-27 22:19:58,902 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 366 flow. Second operand 6 states and 154 transitions. [2024-06-27 22:19:58,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 111 transitions, 746 flow [2024-06-27 22:19:58,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 111 transitions, 719 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 22:19:58,908 INFO L231 Difference]: Finished difference. Result has 75 places, 82 transitions, 511 flow [2024-06-27 22:19:58,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=75, PETRI_TRANSITIONS=82} [2024-06-27 22:19:58,910 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2024-06-27 22:19:58,910 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 82 transitions, 511 flow [2024-06-27 22:19:58,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:58,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:58,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:58,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:19:58,910 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:19:58,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1102159922, now seen corresponding path program 2 times [2024-06-27 22:19:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374925240] [2024-06-27 22:19:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:00,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:20:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374925240] [2024-06-27 22:20:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374925240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:00,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:20:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883340758] [2024-06-27 22:20:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:00,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:20:00,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:20:00,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:20:00,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:00,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:00,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:00,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:00,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:01,206 INFO L124 PetriNetUnfolderBase]: 3751/6203 cut-off events. [2024-06-27 22:20:01,206 INFO L125 PetriNetUnfolderBase]: For 13758/13758 co-relation queries the response was YES. [2024-06-27 22:20:01,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19116 conditions, 6203 events. 3751/6203 cut-off events. For 13758/13758 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 39527 event pairs, 1503 based on Foata normal form. 4/6040 useless extension candidates. Maximal degree in co-relation 19085. Up to 5339 conditions per place. [2024-06-27 22:20:01,239 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 80 selfloop transitions, 15 changer transitions 0/105 dead transitions. [2024-06-27 22:20:01,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 105 transitions, 761 flow [2024-06-27 22:20:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:20:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:20:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-27 22:20:01,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:20:01,241 INFO L175 Difference]: Start difference. First operand has 75 places, 82 transitions, 511 flow. Second operand 6 states and 147 transitions. [2024-06-27 22:20:01,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 105 transitions, 761 flow [2024-06-27 22:20:01,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 105 transitions, 736 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-27 22:20:01,250 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 524 flow [2024-06-27 22:20:01,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2024-06-27 22:20:01,251 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2024-06-27 22:20:01,251 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 524 flow [2024-06-27 22:20:01,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:01,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:01,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:01,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:20:01,252 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:20:01,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1963913270, now seen corresponding path program 3 times [2024-06-27 22:20:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:01,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915336121] [2024-06-27 22:20:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:02,789 INFO 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:20:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915336121] [2024-06-27 22:20:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915336121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:02,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:02,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:20:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220837693] [2024-06-27 22:20:02,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:02,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:20:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:20:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:20:02,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:02,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:02,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:02,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:02,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:03,966 INFO L124 PetriNetUnfolderBase]: 3880/6387 cut-off events. [2024-06-27 22:20:03,967 INFO L125 PetriNetUnfolderBase]: For 15711/15711 co-relation queries the response was YES. [2024-06-27 22:20:03,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20138 conditions, 6387 events. 3880/6387 cut-off events. For 15711/15711 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 40090 event pairs, 1284 based on Foata normal form. 2/6195 useless extension candidates. Maximal degree in co-relation 20104. Up to 5359 conditions per place. [2024-06-27 22:20:04,001 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 86 selfloop transitions, 49 changer transitions 0/145 dead transitions. [2024-06-27 22:20:04,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 145 transitions, 1141 flow [2024-06-27 22:20:04,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:20:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:20:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-06-27 22:20:04,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-27 22:20:04,005 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 524 flow. Second operand 7 states and 180 transitions. [2024-06-27 22:20:04,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 145 transitions, 1141 flow [2024-06-27 22:20:04,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 145 transitions, 1096 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:04,021 INFO L231 Difference]: Finished difference. Result has 85 places, 112 transitions, 877 flow [2024-06-27 22:20:04,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=877, PETRI_PLACES=85, PETRI_TRANSITIONS=112} [2024-06-27 22:20:04,022 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2024-06-27 22:20:04,022 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 112 transitions, 877 flow [2024-06-27 22:20:04,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:04,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:04,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:04,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:20:04,024 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:20:04,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:04,025 INFO L85 PathProgramCache]: Analyzing trace with hash -421752429, now seen corresponding path program 1 times [2024-06-27 22:20:04,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:04,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506611196] [2024-06-27 22:20:04,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:04,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:05,577 INFO 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:20:05,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506611196] [2024-06-27 22:20:05,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506611196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:05,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832882474] [2024-06-27 22:20:05,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:05,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:05,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:05,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:05,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:05,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 112 transitions, 877 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:05,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:05,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:05,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:06,785 INFO L124 PetriNetUnfolderBase]: 3950/6469 cut-off events. [2024-06-27 22:20:06,786 INFO L125 PetriNetUnfolderBase]: For 23540/23540 co-relation queries the response was YES. [2024-06-27 22:20:06,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23311 conditions, 6469 events. 3950/6469 cut-off events. For 23540/23540 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 40424 event pairs, 1313 based on Foata normal form. 4/6272 useless extension candidates. Maximal degree in co-relation 23275. Up to 5578 conditions per place. [2024-06-27 22:20:06,828 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 125 selfloop transitions, 20 changer transitions 0/155 dead transitions. [2024-06-27 22:20:06,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 155 transitions, 1367 flow [2024-06-27 22:20:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:20:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:20:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-27 22:20:06,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2024-06-27 22:20:06,830 INFO L175 Difference]: Start difference. First operand has 85 places, 112 transitions, 877 flow. Second operand 7 states and 174 transitions. [2024-06-27 22:20:06,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 155 transitions, 1367 flow [2024-06-27 22:20:06,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 155 transitions, 1323 flow, removed 21 selfloop flow, removed 1 redundant places. [2024-06-27 22:20:06,854 INFO L231 Difference]: Finished difference. Result has 92 places, 118 transitions, 954 flow [2024-06-27 22:20:06,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=954, PETRI_PLACES=92, PETRI_TRANSITIONS=118} [2024-06-27 22:20:06,855 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2024-06-27 22:20:06,855 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 118 transitions, 954 flow [2024-06-27 22:20:06,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:06,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:06,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:06,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:20:06,856 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:20:06,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash 933143379, now seen corresponding path program 2 times [2024-06-27 22:20:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786919993] [2024-06-27 22:20:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:08,478 INFO 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:20:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786919993] [2024-06-27 22:20:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786919993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60620182] [2024-06-27 22:20:08,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:08,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:08,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:08,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:20:08,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 118 transitions, 954 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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:20:08,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:08,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:20:08,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:09,637 INFO L124 PetriNetUnfolderBase]: 4945/8004 cut-off events. [2024-06-27 22:20:09,637 INFO L125 PetriNetUnfolderBase]: For 30482/30482 co-relation queries the response was YES. [2024-06-27 22:20:09,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28738 conditions, 8004 events. 4945/8004 cut-off events. For 30482/30482 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 50285 event pairs, 1808 based on Foata normal form. 2/7791 useless extension candidates. Maximal degree in co-relation 28698. Up to 6847 conditions per place. [2024-06-27 22:20:09,688 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 133 selfloop transitions, 43 changer transitions 0/185 dead transitions. [2024-06-27 22:20:09,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 185 transitions, 1761 flow [2024-06-27 22:20:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:20:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:20:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-06-27 22:20:09,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2024-06-27 22:20:09,690 INFO L175 Difference]: Start difference. First operand has 92 places, 118 transitions, 954 flow. Second operand 7 states and 171 transitions. [2024-06-27 22:20:09,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 185 transitions, 1761 flow [2024-06-27 22:20:09,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 185 transitions, 1674 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:09,718 INFO L231 Difference]: Finished difference. Result has 97 places, 149 transitions, 1322 flow [2024-06-27 22:20:09,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1322, PETRI_PLACES=97, PETRI_TRANSITIONS=149} [2024-06-27 22:20:09,719 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2024-06-27 22:20:09,719 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 149 transitions, 1322 flow [2024-06-27 22:20:09,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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:20:09,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:09,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:09,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:20:09,720 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:20:09,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash -192779919, now seen corresponding path program 3 times [2024-06-27 22:20:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:09,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691536229] [2024-06-27 22:20:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:11,089 INFO 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:20:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691536229] [2024-06-27 22:20:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691536229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:11,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:11,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:11,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878836209] [2024-06-27 22:20:11,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:11,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:11,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:11,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:11,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:11,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 149 transitions, 1322 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:11,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:11,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:11,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:12,311 INFO L124 PetriNetUnfolderBase]: 4653/7706 cut-off events. [2024-06-27 22:20:12,311 INFO L125 PetriNetUnfolderBase]: For 38044/38060 co-relation queries the response was YES. [2024-06-27 22:20:12,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29731 conditions, 7706 events. 4653/7706 cut-off events. For 38044/38060 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 50141 event pairs, 1674 based on Foata normal form. 18/7502 useless extension candidates. Maximal degree in co-relation 29688. Up to 6448 conditions per place. [2024-06-27 22:20:12,360 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 152 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-06-27 22:20:12,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 191 transitions, 1908 flow [2024-06-27 22:20:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:20:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:20:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-06-27 22:20:12,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-06-27 22:20:12,362 INFO L175 Difference]: Start difference. First operand has 97 places, 149 transitions, 1322 flow. Second operand 7 states and 172 transitions. [2024-06-27 22:20:12,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 191 transitions, 1908 flow [2024-06-27 22:20:12,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 191 transitions, 1837 flow, removed 34 selfloop flow, removed 1 redundant places. [2024-06-27 22:20:12,403 INFO L231 Difference]: Finished difference. Result has 103 places, 152 transitions, 1370 flow [2024-06-27 22:20:12,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1370, PETRI_PLACES=103, PETRI_TRANSITIONS=152} [2024-06-27 22:20:12,404 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places. [2024-06-27 22:20:12,404 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 152 transitions, 1370 flow [2024-06-27 22:20:12,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:12,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:12,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:12,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:20:12,405 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:20:12,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:12,405 INFO L85 PathProgramCache]: Analyzing trace with hash -640789983, now seen corresponding path program 4 times [2024-06-27 22:20:12,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:12,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900906311] [2024-06-27 22:20:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:12,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:13,839 INFO 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:20:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:13,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900906311] [2024-06-27 22:20:13,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900906311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:13,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:13,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:13,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904613422] [2024-06-27 22:20:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:13,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:13,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:13,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:13,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:13,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:13,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 152 transitions, 1370 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:13,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:13,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:13,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:15,428 INFO L124 PetriNetUnfolderBase]: 5088/8301 cut-off events. [2024-06-27 22:20:15,429 INFO L125 PetriNetUnfolderBase]: For 50521/50563 co-relation queries the response was YES. [2024-06-27 22:20:15,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34462 conditions, 8301 events. 5088/8301 cut-off events. For 50521/50563 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 53233 event pairs, 1636 based on Foata normal form. 18/8069 useless extension candidates. Maximal degree in co-relation 34416. Up to 6683 conditions per place. [2024-06-27 22:20:15,487 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 168 selfloop transitions, 74 changer transitions 0/256 dead transitions. [2024-06-27 22:20:15,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 256 transitions, 2533 flow [2024-06-27 22:20:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:20:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:20:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2024-06-27 22:20:15,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2024-06-27 22:20:15,489 INFO L175 Difference]: Start difference. First operand has 103 places, 152 transitions, 1370 flow. Second operand 10 states and 254 transitions. [2024-06-27 22:20:15,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 256 transitions, 2533 flow [2024-06-27 22:20:15,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 256 transitions, 2454 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:15,548 INFO L231 Difference]: Finished difference. Result has 112 places, 196 transitions, 1955 flow [2024-06-27 22:20:15,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1955, PETRI_PLACES=112, PETRI_TRANSITIONS=196} [2024-06-27 22:20:15,548 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places. [2024-06-27 22:20:15,549 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 196 transitions, 1955 flow [2024-06-27 22:20:15,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:15,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:15,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:15,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:20:15,549 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:20:15,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1398665419, now seen corresponding path program 5 times [2024-06-27 22:20:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:15,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271592526] [2024-06-27 22:20:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:17,304 INFO 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:20:17,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:17,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271592526] [2024-06-27 22:20:17,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271592526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:17,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:17,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320456590] [2024-06-27 22:20:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:17,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:17,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:17,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:17,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 196 transitions, 1955 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:17,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:17,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:17,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:18,912 INFO L124 PetriNetUnfolderBase]: 5179/8441 cut-off events. [2024-06-27 22:20:18,912 INFO L125 PetriNetUnfolderBase]: For 73275/73312 co-relation queries the response was YES. [2024-06-27 22:20:18,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39876 conditions, 8441 events. 5179/8441 cut-off events. For 73275/73312 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 54108 event pairs, 1675 based on Foata normal form. 17/8199 useless extension candidates. Maximal degree in co-relation 39825. Up to 7083 conditions per place. [2024-06-27 22:20:18,979 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 178 selfloop transitions, 90 changer transitions 0/282 dead transitions. [2024-06-27 22:20:18,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 282 transitions, 3293 flow [2024-06-27 22:20:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-27 22:20:18,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:20:18,981 INFO L175 Difference]: Start difference. First operand has 112 places, 196 transitions, 1955 flow. Second operand 8 states and 200 transitions. [2024-06-27 22:20:18,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 282 transitions, 3293 flow [2024-06-27 22:20:19,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 282 transitions, 3111 flow, removed 87 selfloop flow, removed 2 redundant places. [2024-06-27 22:20:19,069 INFO L231 Difference]: Finished difference. Result has 121 places, 245 transitions, 2785 flow [2024-06-27 22:20:19,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2785, PETRI_PLACES=121, PETRI_TRANSITIONS=245} [2024-06-27 22:20:19,070 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 67 predicate places. [2024-06-27 22:20:19,070 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 245 transitions, 2785 flow [2024-06-27 22:20:19,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:19,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:19,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:19,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:20:19,070 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:20:19,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:19,071 INFO L85 PathProgramCache]: Analyzing trace with hash 739747983, now seen corresponding path program 6 times [2024-06-27 22:20:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:19,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170024501] [2024-06-27 22:20:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:20,838 INFO 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:20:20,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170024501] [2024-06-27 22:20:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170024501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:20,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679444447] [2024-06-27 22:20:20,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:20,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:20,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:20,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 245 transitions, 2785 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:20,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:20,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:20,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:22,655 INFO L124 PetriNetUnfolderBase]: 5412/8788 cut-off events. [2024-06-27 22:20:22,656 INFO L125 PetriNetUnfolderBase]: For 89490/89538 co-relation queries the response was YES. [2024-06-27 22:20:22,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43876 conditions, 8788 events. 5412/8788 cut-off events. For 89490/89538 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 56345 event pairs, 1552 based on Foata normal form. 46/8572 useless extension candidates. Maximal degree in co-relation 43820. Up to 6353 conditions per place. [2024-06-27 22:20:22,715 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 123 selfloop transitions, 178 changer transitions 0/315 dead transitions. [2024-06-27 22:20:22,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 315 transitions, 3979 flow [2024-06-27 22:20:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-06-27 22:20:22,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5442708333333334 [2024-06-27 22:20:22,716 INFO L175 Difference]: Start difference. First operand has 121 places, 245 transitions, 2785 flow. Second operand 8 states and 209 transitions. [2024-06-27 22:20:22,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 315 transitions, 3979 flow [2024-06-27 22:20:22,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 315 transitions, 3838 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:22,828 INFO L231 Difference]: Finished difference. Result has 128 places, 275 transitions, 3568 flow [2024-06-27 22:20:22,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2644, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3568, PETRI_PLACES=128, PETRI_TRANSITIONS=275} [2024-06-27 22:20:22,829 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 74 predicate places. [2024-06-27 22:20:22,829 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 275 transitions, 3568 flow [2024-06-27 22:20:22,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:20:22,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:22,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:20:22,830 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:20:22,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash -192503864, now seen corresponding path program 1 times [2024-06-27 22:20:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125658498] [2024-06-27 22:20:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125658498] [2024-06-27 22:20:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125658498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:24,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:20:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723572281] [2024-06-27 22:20:24,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:24,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:20:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:24,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:20:24,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:20:24,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:20:24,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 275 transitions, 3568 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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:20:24,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:24,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:20:24,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:26,566 INFO L124 PetriNetUnfolderBase]: 5822/9288 cut-off events. [2024-06-27 22:20:26,566 INFO L125 PetriNetUnfolderBase]: For 119275/119275 co-relation queries the response was YES. [2024-06-27 22:20:26,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50579 conditions, 9288 events. 5822/9288 cut-off events. For 119275/119275 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 57911 event pairs, 1889 based on Foata normal form. 4/9056 useless extension candidates. Maximal degree in co-relation 50520. Up to 8151 conditions per place. [2024-06-27 22:20:26,636 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 285 selfloop transitions, 25 changer transitions 0/319 dead transitions. [2024-06-27 22:20:26,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 319 transitions, 4506 flow [2024-06-27 22:20:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-06-27 22:20:26,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-27 22:20:26,637 INFO L175 Difference]: Start difference. First operand has 128 places, 275 transitions, 3568 flow. Second operand 8 states and 180 transitions. [2024-06-27 22:20:26,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 319 transitions, 4506 flow [2024-06-27 22:20:26,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 319 transitions, 4367 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:26,767 INFO L231 Difference]: Finished difference. Result has 134 places, 285 transitions, 3622 flow [2024-06-27 22:20:26,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3432, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3622, PETRI_PLACES=134, PETRI_TRANSITIONS=285} [2024-06-27 22:20:26,768 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 80 predicate places. [2024-06-27 22:20:26,768 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 285 transitions, 3622 flow [2024-06-27 22:20:26,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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:20:26,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:26,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:26,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:20:26,769 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:20:26,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash 582806354, now seen corresponding path program 1 times [2024-06-27 22:20:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:26,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214986022] [2024-06-27 22:20:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:28,139 INFO 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:20:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214986022] [2024-06-27 22:20:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214986022] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:20:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751553940] [2024-06-27 22:20:28,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:28,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:20:28,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:20:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:20:28,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:28,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 285 transitions, 3622 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:28,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:28,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:28,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:29,688 INFO L124 PetriNetUnfolderBase]: 5498/9075 cut-off events. [2024-06-27 22:20:29,688 INFO L125 PetriNetUnfolderBase]: For 125756/126026 co-relation queries the response was YES. [2024-06-27 22:20:29,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50364 conditions, 9075 events. 5498/9075 cut-off events. For 125756/126026 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 59136 event pairs, 1883 based on Foata normal form. 121/8918 useless extension candidates. Maximal degree in co-relation 50302. Up to 7755 conditions per place. [2024-06-27 22:20:29,763 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 263 selfloop transitions, 13 changer transitions 0/302 dead transitions. [2024-06-27 22:20:29,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 302 transitions, 4280 flow [2024-06-27 22:20:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:20:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:20:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-27 22:20:29,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:20:29,765 INFO L175 Difference]: Start difference. First operand has 134 places, 285 transitions, 3622 flow. Second operand 5 states and 120 transitions. [2024-06-27 22:20:29,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 302 transitions, 4280 flow [2024-06-27 22:20:29,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 302 transitions, 4175 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:29,888 INFO L231 Difference]: Finished difference. Result has 134 places, 288 transitions, 3578 flow [2024-06-27 22:20:29,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3517, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3578, PETRI_PLACES=134, PETRI_TRANSITIONS=288} [2024-06-27 22:20:29,888 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 80 predicate places. [2024-06-27 22:20:29,889 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 288 transitions, 3578 flow [2024-06-27 22:20:29,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:29,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:29,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:29,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:20:29,889 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:20:29,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1859324443, now seen corresponding path program 1 times [2024-06-27 22:20:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606264797] [2024-06-27 22:20:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606264797] [2024-06-27 22:20:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606264797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:31,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783704561] [2024-06-27 22:20:31,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:31,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:31,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:31,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:32,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:32,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 288 transitions, 3578 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:32,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:32,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:32,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:33,897 INFO L124 PetriNetUnfolderBase]: 5766/9313 cut-off events. [2024-06-27 22:20:33,897 INFO L125 PetriNetUnfolderBase]: For 137063/137083 co-relation queries the response was YES. [2024-06-27 22:20:33,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54449 conditions, 9313 events. 5766/9313 cut-off events. For 137063/137083 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 59560 event pairs, 1717 based on Foata normal form. 23/9069 useless extension candidates. Maximal degree in co-relation 54386. Up to 7639 conditions per place. [2024-06-27 22:20:33,964 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 286 selfloop transitions, 97 changer transitions 0/399 dead transitions. [2024-06-27 22:20:33,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 399 transitions, 5559 flow [2024-06-27 22:20:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:20:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:20:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-06-27 22:20:33,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2024-06-27 22:20:33,965 INFO L175 Difference]: Start difference. First operand has 134 places, 288 transitions, 3578 flow. Second operand 10 states and 242 transitions. [2024-06-27 22:20:33,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 399 transitions, 5559 flow [2024-06-27 22:20:34,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 399 transitions, 5534 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:34,097 INFO L231 Difference]: Finished difference. Result has 143 places, 317 transitions, 4321 flow [2024-06-27 22:20:34,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3553, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4321, PETRI_PLACES=143, PETRI_TRANSITIONS=317} [2024-06-27 22:20:34,098 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 89 predicate places. [2024-06-27 22:20:34,098 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 317 transitions, 4321 flow [2024-06-27 22:20:34,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:34,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:34,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:34,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:20:34,099 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:20:34,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:34,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1141044495, now seen corresponding path program 2 times [2024-06-27 22:20:34,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:34,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990370302] [2024-06-27 22:20:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990370302] [2024-06-27 22:20:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990370302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:36,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108174612] [2024-06-27 22:20:36,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:36,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:36,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:36,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:36,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:36,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:36,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 317 transitions, 4321 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:36,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:36,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:36,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:38,263 INFO L124 PetriNetUnfolderBase]: 5747/9292 cut-off events. [2024-06-27 22:20:38,264 INFO L125 PetriNetUnfolderBase]: For 151944/151964 co-relation queries the response was YES. [2024-06-27 22:20:38,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56537 conditions, 9292 events. 5747/9292 cut-off events. For 151944/151964 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 59447 event pairs, 1753 based on Foata normal form. 26/9049 useless extension candidates. Maximal degree in co-relation 56470. Up to 7767 conditions per place. [2024-06-27 22:20:38,347 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 299 selfloop transitions, 63 changer transitions 0/378 dead transitions. [2024-06-27 22:20:38,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 378 transitions, 5554 flow [2024-06-27 22:20:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:20:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:20:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-06-27 22:20:38,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-27 22:20:38,349 INFO L175 Difference]: Start difference. First operand has 143 places, 317 transitions, 4321 flow. Second operand 9 states and 212 transitions. [2024-06-27 22:20:38,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 378 transitions, 5554 flow [2024-06-27 22:20:38,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 378 transitions, 5364 flow, removed 79 selfloop flow, removed 4 redundant places. [2024-06-27 22:20:38,541 INFO L231 Difference]: Finished difference. Result has 148 places, 317 transitions, 4279 flow [2024-06-27 22:20:38,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4131, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4279, PETRI_PLACES=148, PETRI_TRANSITIONS=317} [2024-06-27 22:20:38,542 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 94 predicate places. [2024-06-27 22:20:38,542 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 317 transitions, 4279 flow [2024-06-27 22:20:38,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:38,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:38,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:38,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:20:38,543 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:20:38,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1863139458, now seen corresponding path program 1 times [2024-06-27 22:20:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119345603] [2024-06-27 22:20:38,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:38,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:40,208 INFO 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:20:40,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:40,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119345603] [2024-06-27 22:20:40,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119345603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:40,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119119218] [2024-06-27 22:20:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:40,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:40,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:40,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:40,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:20:40,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 317 transitions, 4279 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:20:40,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:40,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:20:40,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:42,019 INFO L124 PetriNetUnfolderBase]: 6212/9838 cut-off events. [2024-06-27 22:20:42,019 INFO L125 PetriNetUnfolderBase]: For 156003/156003 co-relation queries the response was YES. [2024-06-27 22:20:42,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59239 conditions, 9838 events. 6212/9838 cut-off events. For 156003/156003 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 61200 event pairs, 1831 based on Foata normal form. 3/9643 useless extension candidates. Maximal degree in co-relation 59170. Up to 8329 conditions per place. [2024-06-27 22:20:42,105 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 275 selfloop transitions, 147 changer transitions 0/431 dead transitions. [2024-06-27 22:20:42,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 431 transitions, 6503 flow [2024-06-27 22:20:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-06-27 22:20:42,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2024-06-27 22:20:42,106 INFO L175 Difference]: Start difference. First operand has 148 places, 317 transitions, 4279 flow. Second operand 8 states and 194 transitions. [2024-06-27 22:20:42,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 431 transitions, 6503 flow [2024-06-27 22:20:42,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 431 transitions, 6383 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 22:20:42,262 INFO L231 Difference]: Finished difference. Result has 151 places, 374 transitions, 5517 flow [2024-06-27 22:20:42,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4167, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5517, PETRI_PLACES=151, PETRI_TRANSITIONS=374} [2024-06-27 22:20:42,263 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 97 predicate places. [2024-06-27 22:20:42,263 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 374 transitions, 5517 flow [2024-06-27 22:20:42,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:20:42,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:42,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:42,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:20:42,264 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:20:42,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1863133723, now seen corresponding path program 3 times [2024-06-27 22:20:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159134448] [2024-06-27 22:20:42,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:44,198 INFO 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:20:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159134448] [2024-06-27 22:20:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159134448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:44,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:44,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769486059] [2024-06-27 22:20:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:44,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:44,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:44,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:44,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:44,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 374 transitions, 5517 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:44,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:44,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:44,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:46,125 INFO L124 PetriNetUnfolderBase]: 5945/9363 cut-off events. [2024-06-27 22:20:46,125 INFO L125 PetriNetUnfolderBase]: For 179155/179203 co-relation queries the response was YES. [2024-06-27 22:20:46,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61074 conditions, 9363 events. 5945/9363 cut-off events. For 179155/179203 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 58450 event pairs, 1556 based on Foata normal form. 53/9199 useless extension candidates. Maximal degree in co-relation 61002. Up to 7819 conditions per place. [2024-06-27 22:20:46,212 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 266 selfloop transitions, 181 changer transitions 0/463 dead transitions. [2024-06-27 22:20:46,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 463 transitions, 7588 flow [2024-06-27 22:20:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-06-27 22:20:46,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-27 22:20:46,214 INFO L175 Difference]: Start difference. First operand has 151 places, 374 transitions, 5517 flow. Second operand 8 states and 208 transitions. [2024-06-27 22:20:46,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 463 transitions, 7588 flow [2024-06-27 22:20:46,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 463 transitions, 7237 flow, removed 148 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:46,460 INFO L231 Difference]: Finished difference. Result has 159 places, 398 transitions, 6254 flow [2024-06-27 22:20:46,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5180, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6254, PETRI_PLACES=159, PETRI_TRANSITIONS=398} [2024-06-27 22:20:46,461 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 105 predicate places. [2024-06-27 22:20:46,461 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 398 transitions, 6254 flow [2024-06-27 22:20:46,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:46,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:46,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:46,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:20:46,462 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:20:46,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1137325270, now seen corresponding path program 2 times [2024-06-27 22:20:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009823850] [2024-06-27 22:20:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:48,044 INFO 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:20:48,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009823850] [2024-06-27 22:20:48,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009823850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:48,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:48,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:48,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812460268] [2024-06-27 22:20:48,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:48,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:48,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:48,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:48,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:48,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:20:48,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 398 transitions, 6254 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:20:48,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:48,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:20:48,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:49,982 INFO L124 PetriNetUnfolderBase]: 6360/9850 cut-off events. [2024-06-27 22:20:49,982 INFO L125 PetriNetUnfolderBase]: For 206931/206931 co-relation queries the response was YES. [2024-06-27 22:20:50,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67030 conditions, 9850 events. 6360/9850 cut-off events. For 206931/206931 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 59718 event pairs, 1810 based on Foata normal form. 3/9711 useless extension candidates. Maximal degree in co-relation 66953. Up to 8537 conditions per place. [2024-06-27 22:20:50,062 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 286 selfloop transitions, 151 changer transitions 0/446 dead transitions. [2024-06-27 22:20:50,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 446 transitions, 7484 flow [2024-06-27 22:20:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-06-27 22:20:50,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2024-06-27 22:20:50,064 INFO L175 Difference]: Start difference. First operand has 159 places, 398 transitions, 6254 flow. Second operand 8 states and 193 transitions. [2024-06-27 22:20:50,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 446 transitions, 7484 flow [2024-06-27 22:20:50,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 446 transitions, 7169 flow, removed 148 selfloop flow, removed 2 redundant places. [2024-06-27 22:20:50,401 INFO L231 Difference]: Finished difference. Result has 165 places, 398 transitions, 6258 flow [2024-06-27 22:20:50,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5939, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6258, PETRI_PLACES=165, PETRI_TRANSITIONS=398} [2024-06-27 22:20:50,401 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 111 predicate places. [2024-06-27 22:20:50,402 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 398 transitions, 6258 flow [2024-06-27 22:20:50,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:20:50,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:50,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:20:50,402 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:20:50,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1681209295, now seen corresponding path program 4 times [2024-06-27 22:20:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:50,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532284746] [2024-06-27 22:20:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:50,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:52,263 INFO 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:20:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532284746] [2024-06-27 22:20:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532284746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:52,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:52,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137445792] [2024-06-27 22:20:52,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:52,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:52,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:52,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:52,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:20:52,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 398 transitions, 6258 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:52,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:52,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:20:52,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:54,224 INFO L124 PetriNetUnfolderBase]: 6023/9479 cut-off events. [2024-06-27 22:20:54,224 INFO L125 PetriNetUnfolderBase]: For 215483/215533 co-relation queries the response was YES. [2024-06-27 22:20:54,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66042 conditions, 9479 events. 6023/9479 cut-off events. For 215483/215533 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 59283 event pairs, 1579 based on Foata normal form. 58/9312 useless extension candidates. Maximal degree in co-relation 65963. Up to 8112 conditions per place. [2024-06-27 22:20:54,326 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 388 selfloop transitions, 68 changer transitions 0/472 dead transitions. [2024-06-27 22:20:54,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 472 transitions, 8155 flow [2024-06-27 22:20:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:20:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:20:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-27 22:20:54,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-27 22:20:54,328 INFO L175 Difference]: Start difference. First operand has 165 places, 398 transitions, 6258 flow. Second operand 8 states and 204 transitions. [2024-06-27 22:20:54,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 472 transitions, 8155 flow [2024-06-27 22:20:54,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 472 transitions, 7922 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 22:20:54,760 INFO L231 Difference]: Finished difference. Result has 169 places, 419 transitions, 6623 flow [2024-06-27 22:20:54,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6035, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6623, PETRI_PLACES=169, PETRI_TRANSITIONS=419} [2024-06-27 22:20:54,761 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 115 predicate places. [2024-06-27 22:20:54,761 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 419 transitions, 6623 flow [2024-06-27 22:20:54,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:20:54,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:54,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:54,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:20:54,761 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:20:54,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2007239455, now seen corresponding path program 1 times [2024-06-27 22:20:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750105326] [2024-06-27 22:20:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:56,260 INFO 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:20:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750105326] [2024-06-27 22:20:56,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750105326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:56,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:56,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:20:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663112467] [2024-06-27 22:20:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:56,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:20:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:56,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:20:56,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:20:56,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:20:56,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 419 transitions, 6623 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:20:56,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:56,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:20:56,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:58,583 INFO L124 PetriNetUnfolderBase]: 6519/10109 cut-off events. [2024-06-27 22:20:58,583 INFO L125 PetriNetUnfolderBase]: For 226575/226575 co-relation queries the response was YES. [2024-06-27 22:20:58,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70603 conditions, 10109 events. 6519/10109 cut-off events. For 226575/226575 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 61685 event pairs, 1821 based on Foata normal form. 2/9955 useless extension candidates. Maximal degree in co-relation 70522. Up to 9084 conditions per place. [2024-06-27 22:20:58,685 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 421 selfloop transitions, 46 changer transitions 0/476 dead transitions. [2024-06-27 22:20:58,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 476 transitions, 8148 flow [2024-06-27 22:20:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:20:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:20:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2024-06-27 22:20:58,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46458333333333335 [2024-06-27 22:20:58,686 INFO L175 Difference]: Start difference. First operand has 169 places, 419 transitions, 6623 flow. Second operand 10 states and 223 transitions. [2024-06-27 22:20:58,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 476 transitions, 8148 flow [2024-06-27 22:20:59,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 476 transitions, 7837 flow, removed 144 selfloop flow, removed 3 redundant places. [2024-06-27 22:20:59,150 INFO L231 Difference]: Finished difference. Result has 176 places, 435 transitions, 6791 flow [2024-06-27 22:20:59,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6356, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6791, PETRI_PLACES=176, PETRI_TRANSITIONS=435} [2024-06-27 22:20:59,151 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 122 predicate places. [2024-06-27 22:20:59,151 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 435 transitions, 6791 flow [2024-06-27 22:20:59,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:20:59,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:59,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:20:59,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:20:59,151 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:20:59,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1598235585, now seen corresponding path program 5 times [2024-06-27 22:20:59,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366396830] [2024-06-27 22:20:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:01,728 INFO 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:21:01,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:01,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366396830] [2024-06-27 22:21:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366396830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:01,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:01,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:01,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689076772] [2024-06-27 22:21:01,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:01,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:01,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:21:01,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 435 transitions, 6791 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:21:01,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:01,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:21:01,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:03,792 INFO L124 PetriNetUnfolderBase]: 5869/9296 cut-off events. [2024-06-27 22:21:03,792 INFO L125 PetriNetUnfolderBase]: For 221050/221159 co-relation queries the response was YES. [2024-06-27 22:21:03,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65463 conditions, 9296 events. 5869/9296 cut-off events. For 221050/221159 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 59108 event pairs, 1552 based on Foata normal form. 53/9111 useless extension candidates. Maximal degree in co-relation 65380. Up to 7318 conditions per place. [2024-06-27 22:21:03,884 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 337 selfloop transitions, 154 changer transitions 0/516 dead transitions. [2024-06-27 22:21:03,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 516 transitions, 8781 flow [2024-06-27 22:21:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 238 transitions. [2024-06-27 22:21:03,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5509259259259259 [2024-06-27 22:21:03,886 INFO L175 Difference]: Start difference. First operand has 176 places, 435 transitions, 6791 flow. Second operand 9 states and 238 transitions. [2024-06-27 22:21:03,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 516 transitions, 8781 flow [2024-06-27 22:21:04,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 516 transitions, 8698 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 22:21:04,233 INFO L231 Difference]: Finished difference. Result has 180 places, 447 transitions, 7339 flow [2024-06-27 22:21:04,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6708, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7339, PETRI_PLACES=180, PETRI_TRANSITIONS=447} [2024-06-27 22:21:04,233 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 126 predicate places. [2024-06-27 22:21:04,233 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 447 transitions, 7339 flow [2024-06-27 22:21:04,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:21:04,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:04,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:04,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:21:04,234 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:21:04,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1598325795, now seen corresponding path program 6 times [2024-06-27 22:21:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:04,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458785614] [2024-06-27 22:21:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:06,941 INFO 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:21:06,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:06,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458785614] [2024-06-27 22:21:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458785614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:06,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:06,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:06,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841886304] [2024-06-27 22:21:06,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:06,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:06,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:06,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:06,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:07,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-06-27 22:21:07,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 447 transitions, 7339 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:21:07,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:07,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-06-27 22:21:07,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:08,968 INFO L124 PetriNetUnfolderBase]: 5865/9305 cut-off events. [2024-06-27 22:21:08,968 INFO L125 PetriNetUnfolderBase]: For 236923/237017 co-relation queries the response was YES. [2024-06-27 22:21:09,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67016 conditions, 9305 events. 5865/9305 cut-off events. For 236923/237017 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 59322 event pairs, 1893 based on Foata normal form. 56/9095 useless extension candidates. Maximal degree in co-relation 66931. Up to 7593 conditions per place. [2024-06-27 22:21:09,068 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 374 selfloop transitions, 106 changer transitions 0/505 dead transitions. [2024-06-27 22:21:09,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 505 transitions, 8873 flow [2024-06-27 22:21:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-27 22:21:09,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-06-27 22:21:09,071 INFO L175 Difference]: Start difference. First operand has 180 places, 447 transitions, 7339 flow. Second operand 8 states and 206 transitions. [2024-06-27 22:21:09,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 505 transitions, 8873 flow [2024-06-27 22:21:09,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 505 transitions, 8538 flow, removed 83 selfloop flow, removed 5 redundant places. [2024-06-27 22:21:09,587 INFO L231 Difference]: Finished difference. Result has 184 places, 455 transitions, 7490 flow [2024-06-27 22:21:09,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7040, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7490, PETRI_PLACES=184, PETRI_TRANSITIONS=455} [2024-06-27 22:21:09,587 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 130 predicate places. [2024-06-27 22:21:09,587 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 455 transitions, 7490 flow [2024-06-27 22:21:09,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:21:09,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:09,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:09,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:21:09,588 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:21:09,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1457357843, now seen corresponding path program 2 times [2024-06-27 22:21:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:09,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484794612] [2024-06-27 22:21:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:09,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:11,967 INFO 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:21:11,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:11,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484794612] [2024-06-27 22:21:11,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484794612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:11,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:11,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:11,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691847950] [2024-06-27 22:21:11,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:11,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:11,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:11,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:11,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:12,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:21:12,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 455 transitions, 7490 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:21:12,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:12,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:21:12,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:14,303 INFO L124 PetriNetUnfolderBase]: 6718/10435 cut-off events. [2024-06-27 22:21:14,303 INFO L125 PetriNetUnfolderBase]: For 250747/250751 co-relation queries the response was YES. [2024-06-27 22:21:14,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73943 conditions, 10435 events. 6718/10435 cut-off events. For 250747/250751 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 64258 event pairs, 1782 based on Foata normal form. 5/10269 useless extension candidates. Maximal degree in co-relation 73856. Up to 9082 conditions per place. [2024-06-27 22:21:14,414 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 430 selfloop transitions, 98 changer transitions 0/537 dead transitions. [2024-06-27 22:21:14,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 537 transitions, 9396 flow [2024-06-27 22:21:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:21:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:21:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-27 22:21:14,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 22:21:14,415 INFO L175 Difference]: Start difference. First operand has 184 places, 455 transitions, 7490 flow. Second operand 8 states and 200 transitions. [2024-06-27 22:21:14,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 537 transitions, 9396 flow [2024-06-27 22:21:14,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 537 transitions, 9129 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-27 22:21:14,951 INFO L231 Difference]: Finished difference. Result has 188 places, 481 transitions, 7880 flow [2024-06-27 22:21:14,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7239, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7880, PETRI_PLACES=188, PETRI_TRANSITIONS=481} [2024-06-27 22:21:14,952 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 134 predicate places. [2024-06-27 22:21:14,952 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 481 transitions, 7880 flow [2024-06-27 22:21:14,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:21:14,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:14,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:14,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:21:14,952 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:21:14,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1817525081, now seen corresponding path program 7 times [2024-06-27 22:21:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:14,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101030738] [2024-06-27 22:21:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101030738] [2024-06-27 22:21:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101030738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:17,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:17,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:21:17,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125480735] [2024-06-27 22:21:17,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:17,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:21:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:21:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:21:17,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:17,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 481 transitions, 7880 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:21:17,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:17,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:17,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:19,770 INFO L124 PetriNetUnfolderBase]: 6316/10012 cut-off events. [2024-06-27 22:21:19,770 INFO L125 PetriNetUnfolderBase]: For 252435/252486 co-relation queries the response was YES. [2024-06-27 22:21:19,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72811 conditions, 10012 events. 6316/10012 cut-off events. For 252435/252486 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 63833 event pairs, 1509 based on Foata normal form. 57/9852 useless extension candidates. Maximal degree in co-relation 72720. Up to 7556 conditions per place. [2024-06-27 22:21:19,866 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 266 selfloop transitions, 334 changer transitions 0/618 dead transitions. [2024-06-27 22:21:19,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 618 transitions, 11278 flow [2024-06-27 22:21:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:21:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:21:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2024-06-27 22:21:19,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-06-27 22:21:19,867 INFO L175 Difference]: Start difference. First operand has 188 places, 481 transitions, 7880 flow. Second operand 11 states and 268 transitions. [2024-06-27 22:21:19,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 618 transitions, 11278 flow [2024-06-27 22:21:20,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 618 transitions, 11151 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 22:21:20,337 INFO L231 Difference]: Finished difference. Result has 200 places, 544 transitions, 10078 flow [2024-06-27 22:21:20,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7778, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=278, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10078, PETRI_PLACES=200, PETRI_TRANSITIONS=544} [2024-06-27 22:21:20,338 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 146 predicate places. [2024-06-27 22:21:20,338 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 544 transitions, 10078 flow [2024-06-27 22:21:20,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:21:20,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:20,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:20,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:21:20,338 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:21:20,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash 902322769, now seen corresponding path program 1 times [2024-06-27 22:21:20,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:20,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077560095] [2024-06-27 22:21:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:20,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:22,046 INFO 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:21:22,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077560095] [2024-06-27 22:21:22,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077560095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:22,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:22,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:21:22,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823370086] [2024-06-27 22:21:22,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:22,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:21:22,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:22,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:21:22,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:21:22,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:21:22,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 544 transitions, 10078 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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:21:22,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:22,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:21:22,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:24,526 INFO L124 PetriNetUnfolderBase]: 7050/11520 cut-off events. [2024-06-27 22:21:24,526 INFO L125 PetriNetUnfolderBase]: For 317789/317923 co-relation queries the response was YES. [2024-06-27 22:21:24,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83891 conditions, 11520 events. 7050/11520 cut-off events. For 317789/317923 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 76272 event pairs, 2047 based on Foata normal form. 59/11211 useless extension candidates. Maximal degree in co-relation 83795. Up to 9804 conditions per place. [2024-06-27 22:21:24,663 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 502 selfloop transitions, 16 changer transitions 0/566 dead transitions. [2024-06-27 22:21:24,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 566 transitions, 11288 flow [2024-06-27 22:21:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:21:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:21:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-27 22:21:24,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:21:24,664 INFO L175 Difference]: Start difference. First operand has 200 places, 544 transitions, 10078 flow. Second operand 6 states and 136 transitions. [2024-06-27 22:21:24,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 566 transitions, 11288 flow [2024-06-27 22:21:25,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 566 transitions, 10824 flow, removed 191 selfloop flow, removed 3 redundant places. [2024-06-27 22:21:25,400 INFO L231 Difference]: Finished difference. Result has 203 places, 547 transitions, 9684 flow [2024-06-27 22:21:25,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9614, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9684, PETRI_PLACES=203, PETRI_TRANSITIONS=547} [2024-06-27 22:21:25,401 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 149 predicate places. [2024-06-27 22:21:25,401 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 547 transitions, 9684 flow [2024-06-27 22:21:25,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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:21:25,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:25,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:25,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:21:25,402 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:21:25,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1804423364, now seen corresponding path program 1 times [2024-06-27 22:21:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:25,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22849109] [2024-06-27 22:21:25,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:25,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:27,799 INFO 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:21:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22849109] [2024-06-27 22:21:27,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22849109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289275664] [2024-06-27 22:21:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:27,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:27,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:27,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 547 transitions, 9684 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:27,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:27,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:27,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:30,797 INFO L124 PetriNetUnfolderBase]: 7048/11201 cut-off events. [2024-06-27 22:21:30,797 INFO L125 PetriNetUnfolderBase]: For 335872/335935 co-relation queries the response was YES. [2024-06-27 22:21:30,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85706 conditions, 11201 events. 7048/11201 cut-off events. For 335872/335935 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 72930 event pairs, 1564 based on Foata normal form. 60/10927 useless extension candidates. Maximal degree in co-relation 85608. Up to 8882 conditions per place. [2024-06-27 22:21:30,932 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 521 selfloop transitions, 118 changer transitions 0/658 dead transitions. [2024-06-27 22:21:30,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 658 transitions, 12284 flow [2024-06-27 22:21:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:21:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:21:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 271 transitions. [2024-06-27 22:21:30,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132575757575758 [2024-06-27 22:21:30,933 INFO L175 Difference]: Start difference. First operand has 203 places, 547 transitions, 9684 flow. Second operand 11 states and 271 transitions. [2024-06-27 22:21:30,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 658 transitions, 12284 flow [2024-06-27 22:21:31,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 658 transitions, 12232 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 22:21:31,579 INFO L231 Difference]: Finished difference. Result has 214 places, 574 transitions, 10535 flow [2024-06-27 22:21:31,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9638, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10535, PETRI_PLACES=214, PETRI_TRANSITIONS=574} [2024-06-27 22:21:31,580 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 160 predicate places. [2024-06-27 22:21:31,581 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 574 transitions, 10535 flow [2024-06-27 22:21:31,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:31,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:31,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:31,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:21:31,581 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:21:31,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1015436558, now seen corresponding path program 2 times [2024-06-27 22:21:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:31,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521089307] [2024-06-27 22:21:31,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:33,836 INFO 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:21:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:33,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521089307] [2024-06-27 22:21:33,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521089307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:33,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:33,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078548886] [2024-06-27 22:21:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:33,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:34,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:34,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 574 transitions, 10535 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:34,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:34,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:34,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:37,071 INFO L124 PetriNetUnfolderBase]: 7240/11497 cut-off events. [2024-06-27 22:21:37,071 INFO L125 PetriNetUnfolderBase]: For 366512/366559 co-relation queries the response was YES. [2024-06-27 22:21:37,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90232 conditions, 11497 events. 7240/11497 cut-off events. For 366512/366559 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 75444 event pairs, 1687 based on Foata normal form. 66/11250 useless extension candidates. Maximal degree in co-relation 90129. Up to 9366 conditions per place. [2024-06-27 22:21:37,197 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 507 selfloop transitions, 132 changer transitions 0/658 dead transitions. [2024-06-27 22:21:37,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 658 transitions, 12656 flow [2024-06-27 22:21:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:21:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:21:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions. [2024-06-27 22:21:37,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056818181818182 [2024-06-27 22:21:37,199 INFO L175 Difference]: Start difference. First operand has 214 places, 574 transitions, 10535 flow. Second operand 11 states and 267 transitions. [2024-06-27 22:21:37,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 658 transitions, 12656 flow [2024-06-27 22:21:38,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 658 transitions, 12418 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-27 22:21:38,039 INFO L231 Difference]: Finished difference. Result has 218 places, 576 transitions, 10649 flow [2024-06-27 22:21:38,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10299, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10649, PETRI_PLACES=218, PETRI_TRANSITIONS=576} [2024-06-27 22:21:38,040 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 164 predicate places. [2024-06-27 22:21:38,040 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 576 transitions, 10649 flow [2024-06-27 22:21:38,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:38,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:38,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:38,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:21:38,040 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:21:38,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1012640048, now seen corresponding path program 3 times [2024-06-27 22:21:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:38,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113812483] [2024-06-27 22:21:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:40,267 INFO 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:21:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113812483] [2024-06-27 22:21:40,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113812483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:40,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:40,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815278888] [2024-06-27 22:21:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:40,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:40,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:40,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:40,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:40,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:21:40,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 576 transitions, 10649 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:40,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:40,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:21:40,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:43,442 INFO L124 PetriNetUnfolderBase]: 7188/11412 cut-off events. [2024-06-27 22:21:43,442 INFO L125 PetriNetUnfolderBase]: For 365558/365605 co-relation queries the response was YES. [2024-06-27 22:21:43,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89341 conditions, 11412 events. 7188/11412 cut-off events. For 365558/365605 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 74883 event pairs, 1799 based on Foata normal form. 68/11174 useless extension candidates. Maximal degree in co-relation 89237. Up to 9569 conditions per place. [2024-06-27 22:21:43,566 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 519 selfloop transitions, 98 changer transitions 0/636 dead transitions. [2024-06-27 22:21:43,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 636 transitions, 12337 flow [2024-06-27 22:21:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2024-06-27 22:21:43,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2024-06-27 22:21:43,567 INFO L175 Difference]: Start difference. First operand has 218 places, 576 transitions, 10649 flow. Second operand 9 states and 226 transitions. [2024-06-27 22:21:43,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 636 transitions, 12337 flow [2024-06-27 22:21:44,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 636 transitions, 12060 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-27 22:21:44,405 INFO L231 Difference]: Finished difference. Result has 218 places, 576 transitions, 10581 flow [2024-06-27 22:21:44,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10372, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10581, PETRI_PLACES=218, PETRI_TRANSITIONS=576} [2024-06-27 22:21:44,406 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 164 predicate places. [2024-06-27 22:21:44,406 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 576 transitions, 10581 flow [2024-06-27 22:21:44,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:21:44,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:44,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:44,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:21:44,407 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:21:44,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash -897170938, now seen corresponding path program 1 times [2024-06-27 22:21:44,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800744851] [2024-06-27 22:21:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:46,381 INFO 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:21:46,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:46,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800744851] [2024-06-27 22:21:46,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800744851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:46,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:46,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:46,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255036996] [2024-06-27 22:21:46,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:46,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:46,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:46,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:46,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:21:46,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 576 transitions, 10581 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:21:46,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:46,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:21:46,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:49,220 INFO L124 PetriNetUnfolderBase]: 7801/12241 cut-off events. [2024-06-27 22:21:49,221 INFO L125 PetriNetUnfolderBase]: For 361443/361443 co-relation queries the response was YES. [2024-06-27 22:21:49,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93259 conditions, 12241 events. 7801/12241 cut-off events. For 361443/361443 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 79080 event pairs, 2053 based on Foata normal form. 3/12001 useless extension candidates. Maximal degree in co-relation 93154. Up to 10139 conditions per place. [2024-06-27 22:21:49,388 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 477 selfloop transitions, 186 changer transitions 0/673 dead transitions. [2024-06-27 22:21:49,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 673 transitions, 13180 flow [2024-06-27 22:21:49,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-06-27 22:21:49,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-06-27 22:21:49,390 INFO L175 Difference]: Start difference. First operand has 218 places, 576 transitions, 10581 flow. Second operand 9 states and 213 transitions. [2024-06-27 22:21:49,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 673 transitions, 13180 flow [2024-06-27 22:21:50,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 673 transitions, 13023 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:21:50,423 INFO L231 Difference]: Finished difference. Result has 224 places, 604 transitions, 11465 flow [2024-06-27 22:21:50,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10424, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11465, PETRI_PLACES=224, PETRI_TRANSITIONS=604} [2024-06-27 22:21:50,423 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 170 predicate places. [2024-06-27 22:21:50,423 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 604 transitions, 11465 flow [2024-06-27 22:21:50,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:21:50,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:50,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:50,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:21:50,424 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:21:50,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash -897164180, now seen corresponding path program 1 times [2024-06-27 22:21:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999075799] [2024-06-27 22:21:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:52,474 INFO 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:21:52,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:52,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999075799] [2024-06-27 22:21:52,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999075799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:52,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:52,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761470493] [2024-06-27 22:21:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:52,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:52,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:52,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:52,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:21:52,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 604 transitions, 11465 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:21:52,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:52,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:21:52,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:55,423 INFO L124 PetriNetUnfolderBase]: 7846/12302 cut-off events. [2024-06-27 22:21:55,423 INFO L125 PetriNetUnfolderBase]: For 377908/377908 co-relation queries the response was YES. [2024-06-27 22:21:55,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95568 conditions, 12302 events. 7846/12302 cut-off events. For 377908/377908 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 79299 event pairs, 2058 based on Foata normal form. 4/12069 useless extension candidates. Maximal degree in co-relation 95460. Up to 10719 conditions per place. [2024-06-27 22:21:55,588 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 548 selfloop transitions, 99 changer transitions 0/657 dead transitions. [2024-06-27 22:21:55,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 657 transitions, 13250 flow [2024-06-27 22:21:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:21:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:21:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-06-27 22:21:55,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-27 22:21:55,589 INFO L175 Difference]: Start difference. First operand has 224 places, 604 transitions, 11465 flow. Second operand 9 states and 207 transitions. [2024-06-27 22:21:55,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 657 transitions, 13250 flow [2024-06-27 22:21:56,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 657 transitions, 13049 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-27 22:21:56,650 INFO L231 Difference]: Finished difference. Result has 228 places, 608 transitions, 11577 flow [2024-06-27 22:21:56,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11264, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11577, PETRI_PLACES=228, PETRI_TRANSITIONS=608} [2024-06-27 22:21:56,650 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 174 predicate places. [2024-06-27 22:21:56,651 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 608 transitions, 11577 flow [2024-06-27 22:21:56,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:21:56,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:56,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:56,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:21:56,651 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:21:56,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1922576454, now seen corresponding path program 2 times [2024-06-27 22:21:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444715806] [2024-06-27 22:21:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:58,609 INFO 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:21:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:58,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444715806] [2024-06-27 22:21:58,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444715806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:58,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:58,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:21:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256486239] [2024-06-27 22:21:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:58,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:21:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:58,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:21:58,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:21:58,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:21:58,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 608 transitions, 11577 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:21:58,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:58,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:21:58,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:01,531 INFO L124 PetriNetUnfolderBase]: 7830/12296 cut-off events. [2024-06-27 22:22:01,531 INFO L125 PetriNetUnfolderBase]: For 377483/377483 co-relation queries the response was YES. [2024-06-27 22:22:01,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96030 conditions, 12296 events. 7830/12296 cut-off events. For 377483/377483 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 79563 event pairs, 2083 based on Foata normal form. 3/12054 useless extension candidates. Maximal degree in co-relation 95922. Up to 10186 conditions per place. [2024-06-27 22:22:01,679 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 471 selfloop transitions, 189 changer transitions 0/670 dead transitions. [2024-06-27 22:22:01,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 670 transitions, 13506 flow [2024-06-27 22:22:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:22:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:22:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-06-27 22:22:01,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-06-27 22:22:01,681 INFO L175 Difference]: Start difference. First operand has 228 places, 608 transitions, 11577 flow. Second operand 8 states and 201 transitions. [2024-06-27 22:22:01,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 670 transitions, 13506 flow [2024-06-27 22:22:02,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 670 transitions, 13230 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-27 22:22:02,694 INFO L231 Difference]: Finished difference. Result has 231 places, 609 transitions, 11758 flow [2024-06-27 22:22:02,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11301, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11758, PETRI_PLACES=231, PETRI_TRANSITIONS=609} [2024-06-27 22:22:02,695 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 177 predicate places. [2024-06-27 22:22:02,695 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 609 transitions, 11758 flow [2024-06-27 22:22:02,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:02,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:02,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:02,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:22:02,695 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:22:02,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1922571494, now seen corresponding path program 4 times [2024-06-27 22:22:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:02,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887131811] [2024-06-27 22:22:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:04,808 INFO 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:22:04,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:04,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887131811] [2024-06-27 22:22:04,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887131811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:04,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:04,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:04,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47805005] [2024-06-27 22:22:04,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:04,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:04,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:04,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:04,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:04,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:04,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 609 transitions, 11758 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:04,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:04,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:04,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:08,287 INFO L124 PetriNetUnfolderBase]: 7553/12033 cut-off events. [2024-06-27 22:22:08,287 INFO L125 PetriNetUnfolderBase]: For 415244/415290 co-relation queries the response was YES. [2024-06-27 22:22:08,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96407 conditions, 12033 events. 7553/12033 cut-off events. For 415244/415290 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 80148 event pairs, 1814 based on Foata normal form. 66/11771 useless extension candidates. Maximal degree in co-relation 96297. Up to 9312 conditions per place. [2024-06-27 22:22:08,432 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 433 selfloop transitions, 241 changer transitions 0/698 dead transitions. [2024-06-27 22:22:08,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 698 transitions, 14225 flow [2024-06-27 22:22:08,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:22:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:22:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2024-06-27 22:22:08,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-06-27 22:22:08,433 INFO L175 Difference]: Start difference. First operand has 231 places, 609 transitions, 11758 flow. Second operand 10 states and 248 transitions. [2024-06-27 22:22:08,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 698 transitions, 14225 flow [2024-06-27 22:22:09,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 698 transitions, 13795 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:09,200 INFO L231 Difference]: Finished difference. Result has 236 places, 617 transitions, 12079 flow [2024-06-27 22:22:09,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11332, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12079, PETRI_PLACES=236, PETRI_TRANSITIONS=617} [2024-06-27 22:22:09,201 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 182 predicate places. [2024-06-27 22:22:09,202 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 617 transitions, 12079 flow [2024-06-27 22:22:09,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:09,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:09,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:09,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:22:09,202 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:22:09,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2027768910, now seen corresponding path program 1 times [2024-06-27 22:22:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757899638] [2024-06-27 22:22:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:10,623 INFO 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:22:10,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:10,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757899638] [2024-06-27 22:22:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757899638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:10,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:10,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:22:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101312535] [2024-06-27 22:22:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:22:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:22:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:22:10,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:10,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 617 transitions, 12079 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:22:10,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:10,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:13,551 INFO L124 PetriNetUnfolderBase]: 7896/12898 cut-off events. [2024-06-27 22:22:13,551 INFO L125 PetriNetUnfolderBase]: For 410476/410609 co-relation queries the response was YES. [2024-06-27 22:22:13,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99294 conditions, 12898 events. 7896/12898 cut-off events. For 410476/410609 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 88149 event pairs, 2158 based on Foata normal form. 57/12587 useless extension candidates. Maximal degree in co-relation 99183. Up to 10960 conditions per place. [2024-06-27 22:22:13,759 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 555 selfloop transitions, 41 changer transitions 0/650 dead transitions. [2024-06-27 22:22:13,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 650 transitions, 13657 flow [2024-06-27 22:22:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:22:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:22:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-06-27 22:22:13,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-27 22:22:13,761 INFO L175 Difference]: Start difference. First operand has 236 places, 617 transitions, 12079 flow. Second operand 6 states and 145 transitions. [2024-06-27 22:22:13,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 650 transitions, 13657 flow [2024-06-27 22:22:14,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 650 transitions, 13419 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-27 22:22:14,871 INFO L231 Difference]: Finished difference. Result has 239 places, 629 transitions, 12159 flow [2024-06-27 22:22:14,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=11841, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12159, PETRI_PLACES=239, PETRI_TRANSITIONS=629} [2024-06-27 22:22:14,872 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 185 predicate places. [2024-06-27 22:22:14,872 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 629 transitions, 12159 flow [2024-06-27 22:22:14,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:22:14,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:14,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:14,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:22:14,872 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:22:14,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash -758284116, now seen corresponding path program 2 times [2024-06-27 22:22:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182584922] [2024-06-27 22:22:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:16,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:16,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182584922] [2024-06-27 22:22:16,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182584922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:16,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:16,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:16,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297211620] [2024-06-27 22:22:16,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:16,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:16,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:16,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:16,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:17,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:22:17,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 629 transitions, 12159 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:17,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:17,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:22:17,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:20,506 INFO L124 PetriNetUnfolderBase]: 8343/13436 cut-off events. [2024-06-27 22:22:20,506 INFO L125 PetriNetUnfolderBase]: For 426487/426487 co-relation queries the response was YES. [2024-06-27 22:22:20,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103921 conditions, 13436 events. 8343/13436 cut-off events. For 426487/426487 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 89938 event pairs, 2203 based on Foata normal form. 4/13089 useless extension candidates. Maximal degree in co-relation 103807. Up to 11564 conditions per place. [2024-06-27 22:22:20,700 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 625 selfloop transitions, 61 changer transitions 0/696 dead transitions. [2024-06-27 22:22:20,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 696 transitions, 14340 flow [2024-06-27 22:22:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-06-27 22:22:20,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699074074074074 [2024-06-27 22:22:20,701 INFO L175 Difference]: Start difference. First operand has 239 places, 629 transitions, 12159 flow. Second operand 9 states and 203 transitions. [2024-06-27 22:22:20,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 696 transitions, 14340 flow [2024-06-27 22:22:22,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 696 transitions, 14237 flow, removed 50 selfloop flow, removed 1 redundant places. [2024-06-27 22:22:22,025 INFO L231 Difference]: Finished difference. Result has 248 places, 650 transitions, 12610 flow [2024-06-27 22:22:22,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12056, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12610, PETRI_PLACES=248, PETRI_TRANSITIONS=650} [2024-06-27 22:22:22,026 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 194 predicate places. [2024-06-27 22:22:22,026 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 650 transitions, 12610 flow [2024-06-27 22:22:22,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:22,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:22,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:22,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:22:22,027 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:22:22,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2088210628, now seen corresponding path program 5 times [2024-06-27 22:22:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565885347] [2024-06-27 22:22:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:24,230 INFO 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:22:24,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565885347] [2024-06-27 22:22:24,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565885347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:24,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:24,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594082364] [2024-06-27 22:22:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:24,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:24,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:24,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:24,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:22:24,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 650 transitions, 12610 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:24,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:24,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:22:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:28,047 INFO L124 PetriNetUnfolderBase]: 8038/13144 cut-off events. [2024-06-27 22:22:28,047 INFO L125 PetriNetUnfolderBase]: For 474950/474983 co-relation queries the response was YES. [2024-06-27 22:22:28,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105159 conditions, 13144 events. 8038/13144 cut-off events. For 474950/474983 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 90428 event pairs, 1977 based on Foata normal form. 57/12742 useless extension candidates. Maximal degree in co-relation 105041. Up to 10318 conditions per place. [2024-06-27 22:22:28,245 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 585 selfloop transitions, 116 changer transitions 0/727 dead transitions. [2024-06-27 22:22:28,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 727 transitions, 15061 flow [2024-06-27 22:22:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:22:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:22:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-27 22:22:28,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-06-27 22:22:28,246 INFO L175 Difference]: Start difference. First operand has 248 places, 650 transitions, 12610 flow. Second operand 9 states and 231 transitions. [2024-06-27 22:22:28,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 727 transitions, 15061 flow [2024-06-27 22:22:29,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 727 transitions, 14889 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-27 22:22:29,881 INFO L231 Difference]: Finished difference. Result has 252 places, 659 transitions, 13015 flow [2024-06-27 22:22:29,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12438, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13015, PETRI_PLACES=252, PETRI_TRANSITIONS=659} [2024-06-27 22:22:29,882 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 198 predicate places. [2024-06-27 22:22:29,882 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 659 transitions, 13015 flow [2024-06-27 22:22:29,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:22:29,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:29,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:29,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:22:29,883 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:22:29,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash -493183896, now seen corresponding path program 3 times [2024-06-27 22:22:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:29,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019400178] [2024-06-27 22:22:29,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:29,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:31,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:22:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019400178] [2024-06-27 22:22:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019400178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:31,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:31,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073233044] [2024-06-27 22:22:31,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:31,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:31,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:31,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:22:31,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 659 transitions, 13015 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:31,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:31,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:22:31,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:35,309 INFO L124 PetriNetUnfolderBase]: 8596/13909 cut-off events. [2024-06-27 22:22:35,309 INFO L125 PetriNetUnfolderBase]: For 497480/497480 co-relation queries the response was YES. [2024-06-27 22:22:35,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111778 conditions, 13909 events. 8596/13909 cut-off events. For 497480/497480 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 94199 event pairs, 2230 based on Foata normal form. 4/13542 useless extension candidates. Maximal degree in co-relation 111658. Up to 12075 conditions per place. [2024-06-27 22:22:35,491 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 669 selfloop transitions, 32 changer transitions 0/711 dead transitions. [2024-06-27 22:22:35,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 711 transitions, 14837 flow [2024-06-27 22:22:35,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:22:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:22:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 256 transitions. [2024-06-27 22:22:35,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:22:35,492 INFO L175 Difference]: Start difference. First operand has 252 places, 659 transitions, 13015 flow. Second operand 12 states and 256 transitions. [2024-06-27 22:22:35,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 711 transitions, 14837 flow [2024-06-27 22:22:37,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 711 transitions, 14420 flow, removed 130 selfloop flow, removed 5 redundant places. [2024-06-27 22:22:37,242 INFO L231 Difference]: Finished difference. Result has 260 places, 664 transitions, 12791 flow [2024-06-27 22:22:37,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12600, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12791, PETRI_PLACES=260, PETRI_TRANSITIONS=664} [2024-06-27 22:22:37,243 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 206 predicate places. [2024-06-27 22:22:37,243 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 664 transitions, 12791 flow [2024-06-27 22:22:37,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:37,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:37,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:37,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:22:37,244 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:22:37,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash -502677336, now seen corresponding path program 4 times [2024-06-27 22:22:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:37,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054689365] [2024-06-27 22:22:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:37,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:22:39,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054689365] [2024-06-27 22:22:39,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054689365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:39,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:39,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:39,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457115702] [2024-06-27 22:22:39,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:39,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:39,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:39,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:22:39,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 664 transitions, 12791 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:39,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:39,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:22:39,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:42,955 INFO L124 PetriNetUnfolderBase]: 8633/13949 cut-off events. [2024-06-27 22:22:42,955 INFO L125 PetriNetUnfolderBase]: For 501448/501448 co-relation queries the response was YES. [2024-06-27 22:22:43,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111836 conditions, 13949 events. 8633/13949 cut-off events. For 501448/501448 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 94419 event pairs, 2325 based on Foata normal form. 4/13587 useless extension candidates. Maximal degree in co-relation 111714. Up to 12134 conditions per place. [2024-06-27 22:22:43,136 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 670 selfloop transitions, 39 changer transitions 0/719 dead transitions. [2024-06-27 22:22:43,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 719 transitions, 14900 flow [2024-06-27 22:22:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:22:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:22:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-27 22:22:43,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869791666666667 [2024-06-27 22:22:43,137 INFO L175 Difference]: Start difference. First operand has 260 places, 664 transitions, 12791 flow. Second operand 8 states and 187 transitions. [2024-06-27 22:22:43,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 719 transitions, 14900 flow [2024-06-27 22:22:44,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 719 transitions, 14725 flow, removed 44 selfloop flow, removed 11 redundant places. [2024-06-27 22:22:44,576 INFO L231 Difference]: Finished difference. Result has 258 places, 677 transitions, 13070 flow [2024-06-27 22:22:44,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12627, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13070, PETRI_PLACES=258, PETRI_TRANSITIONS=677} [2024-06-27 22:22:44,576 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 204 predicate places. [2024-06-27 22:22:44,576 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 677 transitions, 13070 flow [2024-06-27 22:22:44,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:44,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:44,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:44,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:22:44,577 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:22:44,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:44,577 INFO L85 PathProgramCache]: Analyzing trace with hash -493509644, now seen corresponding path program 3 times [2024-06-27 22:22:44,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:44,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006854248] [2024-06-27 22:22:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:44,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:46,450 INFO 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:22:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006854248] [2024-06-27 22:22:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006854248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380178470] [2024-06-27 22:22:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:46,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:46,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:22:46,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 677 transitions, 13070 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:46,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:46,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:22:46,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:50,478 INFO L124 PetriNetUnfolderBase]: 8663/14000 cut-off events. [2024-06-27 22:22:50,478 INFO L125 PetriNetUnfolderBase]: For 511935/511935 co-relation queries the response was YES. [2024-06-27 22:22:50,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112645 conditions, 14000 events. 8663/14000 cut-off events. For 511935/511935 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 94798 event pairs, 2275 based on Foata normal form. 2/13630 useless extension candidates. Maximal degree in co-relation 112522. Up to 12093 conditions per place. [2024-06-27 22:22:50,658 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 660 selfloop transitions, 76 changer transitions 0/746 dead transitions. [2024-06-27 22:22:50,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 746 transitions, 15265 flow [2024-06-27 22:22:50,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:22:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:22:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2024-06-27 22:22:50,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-27 22:22:50,660 INFO L175 Difference]: Start difference. First operand has 258 places, 677 transitions, 13070 flow. Second operand 11 states and 248 transitions. [2024-06-27 22:22:50,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 746 transitions, 15265 flow [2024-06-27 22:22:52,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 746 transitions, 15051 flow, removed 81 selfloop flow, removed 4 redundant places. [2024-06-27 22:22:52,521 INFO L231 Difference]: Finished difference. Result has 265 places, 694 transitions, 13428 flow [2024-06-27 22:22:52,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=12886, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13428, PETRI_PLACES=265, PETRI_TRANSITIONS=694} [2024-06-27 22:22:52,525 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 211 predicate places. [2024-06-27 22:22:52,526 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 694 transitions, 13428 flow [2024-06-27 22:22:52,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:52,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:22:52,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:22:52,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:22:52,526 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:22:52,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:22:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash -493509396, now seen corresponding path program 5 times [2024-06-27 22:22:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:22:52,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873932296] [2024-06-27 22:22:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:22:52,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:22:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:22:54,335 INFO 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:22:54,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:22:54,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873932296] [2024-06-27 22:22:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873932296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:22:54,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:22:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:22:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870936700] [2024-06-27 22:22:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:22:54,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:22:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:22:54,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:22:54,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:22:54,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-06-27 22:22:54,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 694 transitions, 13428 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:22:54,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:22:54,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-06-27 22:22:54,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:22:58,412 INFO L124 PetriNetUnfolderBase]: 8700/14064 cut-off events. [2024-06-27 22:22:58,412 INFO L125 PetriNetUnfolderBase]: For 524969/524969 co-relation queries the response was YES. [2024-06-27 22:22:58,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113278 conditions, 14064 events. 8700/14064 cut-off events. For 524969/524969 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 95354 event pairs, 2294 based on Foata normal form. 4/13694 useless extension candidates. Maximal degree in co-relation 113154. Up to 12193 conditions per place. [2024-06-27 22:22:58,593 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 678 selfloop transitions, 58 changer transitions 0/746 dead transitions. [2024-06-27 22:22:58,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 746 transitions, 15334 flow [2024-06-27 22:22:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:22:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:22:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 246 transitions. [2024-06-27 22:22:58,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-06-27 22:22:58,594 INFO L175 Difference]: Start difference. First operand has 265 places, 694 transitions, 13428 flow. Second operand 11 states and 246 transitions. [2024-06-27 22:22:58,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 746 transitions, 15334 flow [2024-06-27 22:23:00,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 746 transitions, 15190 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-27 22:23:00,256 INFO L231 Difference]: Finished difference. Result has 267 places, 697 transitions, 13520 flow [2024-06-27 22:23:00,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=13284, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13520, PETRI_PLACES=267, PETRI_TRANSITIONS=697} [2024-06-27 22:23:00,257 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 213 predicate places. [2024-06-27 22:23:00,257 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 697 transitions, 13520 flow [2024-06-27 22:23:00,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:23:00,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:00,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:00,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:23:00,257 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:23:00,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1731193104, now seen corresponding path program 2 times [2024-06-27 22:23:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:00,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079606309] [2024-06-27 22:23:00,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:00,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:01,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:01,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079606309] [2024-06-27 22:23:01,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079606309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:01,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:01,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:23:01,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134949263] [2024-06-27 22:23:01,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:01,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:23:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:23:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:23:01,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:01,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 697 transitions, 13520 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:23:01,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:01,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:01,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:23:05,126 INFO L124 PetriNetUnfolderBase]: 8306/13611 cut-off events. [2024-06-27 22:23:05,126 INFO L125 PetriNetUnfolderBase]: For 533765/533858 co-relation queries the response was YES. [2024-06-27 22:23:05,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109916 conditions, 13611 events. 8306/13611 cut-off events. For 533765/533858 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 94106 event pairs, 2295 based on Foata normal form. 54/13268 useless extension candidates. Maximal degree in co-relation 109791. Up to 11581 conditions per place. [2024-06-27 22:23:05,303 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 625 selfloop transitions, 16 changer transitions 0/711 dead transitions. [2024-06-27 22:23:05,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 711 transitions, 14874 flow [2024-06-27 22:23:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:23:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:23:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-06-27 22:23:05,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-27 22:23:05,304 INFO L175 Difference]: Start difference. First operand has 267 places, 697 transitions, 13520 flow. Second operand 6 states and 138 transitions. [2024-06-27 22:23:05,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 711 transitions, 14874 flow [2024-06-27 22:23:06,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 711 transitions, 14632 flow, removed 65 selfloop flow, removed 9 redundant places. [2024-06-27 22:23:06,792 INFO L231 Difference]: Finished difference. Result has 264 places, 697 transitions, 13317 flow [2024-06-27 22:23:06,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=13278, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13317, PETRI_PLACES=264, PETRI_TRANSITIONS=697} [2024-06-27 22:23:06,793 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 210 predicate places. [2024-06-27 22:23:06,793 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 697 transitions, 13317 flow [2024-06-27 22:23:06,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:23:06,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:23:06,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:23:06,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:23:06,794 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:23:06,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:23:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash -107784150, now seen corresponding path program 6 times [2024-06-27 22:23:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:23:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859756912] [2024-06-27 22:23:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:23:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:23:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:23:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:23:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:23:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859756912] [2024-06-27 22:23:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859756912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:23:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:23:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:23:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912320709] [2024-06-27 22:23:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:23:08,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:23:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:23:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:23:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:23:08,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-06-27 22:23:08,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 697 transitions, 13317 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:23:08,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:23:08,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-06-27 22:23:08,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand