./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix016_pso.opt_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/mix016_pso.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix016_pso.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 18:35:48,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:35:48,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:35:48,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:35:48,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:35:48,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:35:48,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:35:48,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:35:48,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:35:48,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:35:48,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:35:48,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:35:48,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:35:48,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:35:48,910 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:35:48,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:35:48,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:35:48,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:35:48,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:35:48,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:35:48,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:35:48,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:35:48,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:35:48,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:35:48,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:35:48,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:35:48,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:35:48,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:35:48,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:35:48,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:35:48,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:35:48,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:35:48,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:35:48,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:35:48,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:35:48,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:35:48,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:35:48,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:35:48,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:35:48,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:35:48,917 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:35:48,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:35:48,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:35:48,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-20 18:35:49,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:35:49,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:35:49,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:35:49,187 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:35:49,187 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:35:49,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix016_pso.opt_tso.opt.yml/witness.yml [2024-06-20 18:35:49,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:35:49,399 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:35:49,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2024-06-20 18:35:50,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:35:50,896 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:35:50,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2024-06-20 18:35:50,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856f95ef9/75166051ccaa4a9d915e3c38db71c9ef/FLAG3ef5430ec [2024-06-20 18:35:50,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856f95ef9/75166051ccaa4a9d915e3c38db71c9ef [2024-06-20 18:35:50,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:35:50,931 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:35:50,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:35:50,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:35:50,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:35:50,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:35:49" (1/2) ... [2024-06-20 18:35:50,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d5ca6d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:35:50, skipping insertion in model container [2024-06-20 18:35:50,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:35:49" (1/2) ... [2024-06-20 18:35:50,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ee514d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:35:50, skipping insertion in model container [2024-06-20 18:35:50,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:35:50" (2/2) ... [2024-06-20 18:35:50,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d5ca6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:50, skipping insertion in model container [2024-06-20 18:35:50,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:35:50" (2/2) ... [2024-06-20 18:35:50,941 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:35:51,041 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:35:51,043 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-20 18:35:51,044 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-20 18:35:51,044 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-06-20 18:35:51,045 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:35:51,046 INFO L106 edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1; [2024-06-20 18:35:51,094 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:35:51,437 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:35:51,447 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 18:35:51,905 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:35:51,949 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:35:51,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51 WrapperNode [2024-06-20 18:35:51,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:35:51,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:35:51,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:35:51,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:35:51,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,149 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-06-20 18:35:52,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:35:52,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:35:52,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:35:52,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:35:52,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,270 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-20 18:35:52,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:35:52,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:35:52,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:35:52,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:35:52,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (1/1) ... [2024-06-20 18:35:52,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:35:52,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:35:52,393 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-20 18:35:52,400 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-20 18:35:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 18:35:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:35:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 18:35:52,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 18:35:52,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 18:35:52,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 18:35:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 18:35:52,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 18:35:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:35:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 18:35:52,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:35:52,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:35:52,437 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 18:35:52,580 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:35:52,583 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:35:54,154 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:35:54,156 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:35:54,519 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:35:54,519 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 18:35:54,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:35:54 BoogieIcfgContainer [2024-06-20 18:35:54,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:35:54,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:35:54,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:35:54,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:35:54,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:35:49" (1/4) ... [2024-06-20 18:35:54,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640d1a79 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:35:54, skipping insertion in model container [2024-06-20 18:35:54,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:35:50" (2/4) ... [2024-06-20 18:35:54,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640d1a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:35:54, skipping insertion in model container [2024-06-20 18:35:54,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:35:51" (3/4) ... [2024-06-20 18:35:54,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640d1a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:35:54, skipping insertion in model container [2024-06-20 18:35:54,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:35:54" (4/4) ... [2024-06-20 18:35:54,532 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2024-06-20 18:35:54,549 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:35:54,550 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 18:35:54,550 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:35:54,688 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 18:35:54,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-20 18:35:54,788 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-20 18:35:54,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:35:54,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 18:35:54,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-20 18:35:54,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-20 18:35:54,810 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:35:54,818 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;@488e92a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:35:54,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 18:35:54,828 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:35:54,828 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 18:35:54,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:35:54,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:35:54,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 18:35:54,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:35:54,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:35:54,839 INFO L85 PathProgramCache]: Analyzing trace with hash 397045706, now seen corresponding path program 1 times [2024-06-20 18:35:54,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:35:54,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241190194] [2024-06-20 18:35:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:35:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:35:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:01,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241190194] [2024-06-20 18:36:01,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241190194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:01,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:01,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:36:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974726638] [2024-06-20 18:36:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:02,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:36:02,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:02,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:36:02,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:36:02,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-06-20 18:36:02,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:02,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:02,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-06-20 18:36:02,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:03,135 INFO L124 PetriNetUnfolderBase]: 869/1398 cut-off events. [2024-06-20 18:36:03,135 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-06-20 18:36:03,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2776 conditions, 1398 events. 869/1398 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7015 event pairs, 566 based on Foata normal form. 1/1345 useless extension candidates. Maximal degree in co-relation 2764. Up to 1315 conditions per place. [2024-06-20 18:36:03,151 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 30 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-20 18:36:03,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 167 flow [2024-06-20 18:36:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:36:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:36:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-20 18:36:03,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277 [2024-06-20 18:36:03,171 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 79 transitions. [2024-06-20 18:36:03,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 167 flow [2024-06-20 18:36:03,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 18:36:03,177 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-20 18:36:03,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-20 18:36:03,182 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-20 18:36:03,183 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-20 18:36:03,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:03,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:03,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:03,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:36:03,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:03,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash -691136087, now seen corresponding path program 1 times [2024-06-20 18:36:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:03,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38909747] [2024-06-20 18:36:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:08,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:08,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38909747] [2024-06-20 18:36:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38909747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:08,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:36:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470203970] [2024-06-20 18:36:08,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:08,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:36:08,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:08,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:36:08,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:36:08,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-06-20 18:36:08,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:08,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:08,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-06-20 18:36:08,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:09,495 INFO L124 PetriNetUnfolderBase]: 996/1549 cut-off events. [2024-06-20 18:36:09,495 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-06-20 18:36:09,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3564 conditions, 1549 events. 996/1549 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7582 event pairs, 519 based on Foata normal form. 3/1549 useless extension candidates. Maximal degree in co-relation 3552. Up to 1484 conditions per place. [2024-06-20 18:36:09,507 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 38 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-20 18:36:09,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 236 flow [2024-06-20 18:36:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:36:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:36:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-06-20 18:36:09,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-06-20 18:36:09,512 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 100 transitions. [2024-06-20 18:36:09,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 236 flow [2024-06-20 18:36:09,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:36:09,516 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-20 18:36:09,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-20 18:36:09,517 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-20 18:36:09,517 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-20 18:36:09,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:09,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:09,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:09,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 18:36:09,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:09,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 439035286, now seen corresponding path program 1 times [2024-06-20 18:36:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:09,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716313235] [2024-06-20 18:36:09,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:09,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:14,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:14,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716313235] [2024-06-20 18:36:14,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716313235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:14,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:36:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633766859] [2024-06-20 18:36:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:14,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:36:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:36:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:36:14,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 18:36:14,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:14,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:14,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 18:36:14,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:15,772 INFO L124 PetriNetUnfolderBase]: 1265/1933 cut-off events. [2024-06-20 18:36:15,772 INFO L125 PetriNetUnfolderBase]: For 1101/1101 co-relation queries the response was YES. [2024-06-20 18:36:15,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4930 conditions, 1933 events. 1265/1933 cut-off events. For 1101/1101 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9175 event pairs, 445 based on Foata normal form. 6/1933 useless extension candidates. Maximal degree in co-relation 4916. Up to 1828 conditions per place. [2024-06-20 18:36:15,784 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 50 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2024-06-20 18:36:15,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 348 flow [2024-06-20 18:36:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:36:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:36:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-20 18:36:15,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.556910569105691 [2024-06-20 18:36:15,787 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 6 states and 137 transitions. [2024-06-20 18:36:15,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 348 flow [2024-06-20 18:36:15,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 328 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-20 18:36:15,794 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 179 flow [2024-06-20 18:36:15,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-20 18:36:15,795 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2024-06-20 18:36:15,796 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 179 flow [2024-06-20 18:36:15,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:15,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:15,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:15,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 18:36:15,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:15,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash -30884977, now seen corresponding path program 1 times [2024-06-20 18:36:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:15,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216896220] [2024-06-20 18:36:15,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:15,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:25,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216896220] [2024-06-20 18:36:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216896220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:25,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:36:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40222577] [2024-06-20 18:36:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:25,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:36:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:25,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:36:25,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:36:25,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:36:25,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:25,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:25,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:36:25,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:26,797 INFO L124 PetriNetUnfolderBase]: 1085/1742 cut-off events. [2024-06-20 18:36:26,798 INFO L125 PetriNetUnfolderBase]: For 1768/1768 co-relation queries the response was YES. [2024-06-20 18:36:26,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 1742 events. 1085/1742 cut-off events. For 1768/1768 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8600 event pairs, 442 based on Foata normal form. 4/1738 useless extension candidates. Maximal degree in co-relation 4782. Up to 1611 conditions per place. [2024-06-20 18:36:26,808 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 43 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-06-20 18:36:26,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 325 flow [2024-06-20 18:36:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:36:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:36:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-20 18:36:26,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-20 18:36:26,810 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 179 flow. Second operand 5 states and 100 transitions. [2024-06-20 18:36:26,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 325 flow [2024-06-20 18:36:26,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 298 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 18:36:26,814 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 196 flow [2024-06-20 18:36:26,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-20 18:36:26,815 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2024-06-20 18:36:26,815 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 196 flow [2024-06-20 18:36:26,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:26,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:26,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:26,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 18:36:26,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:26,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -104308520, now seen corresponding path program 1 times [2024-06-20 18:36:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177954041] [2024-06-20 18:36:26,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:36,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177954041] [2024-06-20 18:36:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177954041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:36:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006152778] [2024-06-20 18:36:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:36,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:36:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:36,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:36:36,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:36:37,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:36:37,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:37,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:37,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:36:37,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:38,163 INFO L124 PetriNetUnfolderBase]: 1277/1951 cut-off events. [2024-06-20 18:36:38,164 INFO L125 PetriNetUnfolderBase]: For 3080/3080 co-relation queries the response was YES. [2024-06-20 18:36:38,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 1951 events. 1277/1951 cut-off events. For 3080/3080 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9218 event pairs, 487 based on Foata normal form. 4/1953 useless extension candidates. Maximal degree in co-relation 5912. Up to 1826 conditions per place. [2024-06-20 18:36:38,179 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 16 changer transitions 0/74 dead transitions. [2024-06-20 18:36:38,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 442 flow [2024-06-20 18:36:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:36:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:36:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-06-20 18:36:38,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2024-06-20 18:36:38,184 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 196 flow. Second operand 6 states and 122 transitions. [2024-06-20 18:36:38,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 442 flow [2024-06-20 18:36:38,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 422 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 18:36:38,197 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 258 flow [2024-06-20 18:36:38,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2024-06-20 18:36:38,200 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-20 18:36:38,200 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 258 flow [2024-06-20 18:36:38,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:38,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:38,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:38,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 18:36:38,202 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:38,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash -76453160, now seen corresponding path program 2 times [2024-06-20 18:36:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243668410] [2024-06-20 18:36:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:36:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:36:48,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:36:48,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243668410] [2024-06-20 18:36:48,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243668410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:36:48,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:36:48,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:36:48,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108301128] [2024-06-20 18:36:48,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:36:48,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:36:48,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:36:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:36:48,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:36:48,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:36:48,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:48,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:36:48,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:36:48,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:36:49,340 INFO L124 PetriNetUnfolderBase]: 1267/1937 cut-off events. [2024-06-20 18:36:49,341 INFO L125 PetriNetUnfolderBase]: For 4376/4376 co-relation queries the response was YES. [2024-06-20 18:36:49,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6369 conditions, 1937 events. 1267/1937 cut-off events. For 4376/4376 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9120 event pairs, 479 based on Foata normal form. 4/1940 useless extension candidates. Maximal degree in co-relation 6349. Up to 1818 conditions per place. [2024-06-20 18:36:49,355 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 58 selfloop transitions, 17 changer transitions 0/80 dead transitions. [2024-06-20 18:36:49,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 480 flow [2024-06-20 18:36:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:36:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:36:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 18:36:49,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 18:36:49,358 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 258 flow. Second operand 8 states and 152 transitions. [2024-06-20 18:36:49,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 480 flow [2024-06-20 18:36:49,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 450 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-20 18:36:49,365 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 270 flow [2024-06-20 18:36:49,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=270, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-06-20 18:36:49,367 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2024-06-20 18:36:49,367 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 270 flow [2024-06-20 18:36:49,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:36:49,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:36:49,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:36:49,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 18:36:49,368 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:36:49,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:36:49,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1147526490, now seen corresponding path program 1 times [2024-06-20 18:36:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:36:49,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292714695] [2024-06-20 18:36:49,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:36:49,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:36:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:00,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292714695] [2024-06-20 18:37:00,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292714695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:00,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:00,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:37:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454039772] [2024-06-20 18:37:00,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:00,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:37:00,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:00,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:37:00,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:37:00,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:37:00,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 270 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 18:37:00,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:00,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:37:00,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:01,794 INFO L124 PetriNetUnfolderBase]: 1289/1983 cut-off events. [2024-06-20 18:37:01,794 INFO L125 PetriNetUnfolderBase]: For 5408/5408 co-relation queries the response was YES. [2024-06-20 18:37:01,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6629 conditions, 1983 events. 1289/1983 cut-off events. For 5408/5408 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9520 event pairs, 518 based on Foata normal form. 4/1986 useless extension candidates. Maximal degree in co-relation 6607. Up to 1858 conditions per place. [2024-06-20 18:37:01,805 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 52 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2024-06-20 18:37:01,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 476 flow [2024-06-20 18:37:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:37:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:37:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-20 18:37:01,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2024-06-20 18:37:01,807 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 270 flow. Second operand 6 states and 118 transitions. [2024-06-20 18:37:01,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 476 flow [2024-06-20 18:37:01,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 430 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 18:37:01,812 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 296 flow [2024-06-20 18:37:01,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-06-20 18:37:01,813 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-06-20 18:37:01,813 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 296 flow [2024-06-20 18:37:01,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 18:37:01,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:01,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:01,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 18:37:01,814 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:37:01,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1061404318, now seen corresponding path program 2 times [2024-06-20 18:37:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:01,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86793604] [2024-06-20 18:37:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:12,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86793604] [2024-06-20 18:37:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86793604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:12,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:37:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350479204] [2024-06-20 18:37:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:12,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:37:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:37:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:37:12,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:37:12,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 296 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 18:37:12,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:12,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:37:12,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:13,953 INFO L124 PetriNetUnfolderBase]: 1311/2025 cut-off events. [2024-06-20 18:37:13,953 INFO L125 PetriNetUnfolderBase]: For 7109/7109 co-relation queries the response was YES. [2024-06-20 18:37:13,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7214 conditions, 2025 events. 1311/2025 cut-off events. For 7109/7109 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9775 event pairs, 437 based on Foata normal form. 4/2028 useless extension candidates. Maximal degree in co-relation 7192. Up to 1797 conditions per place. [2024-06-20 18:37:13,966 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 60 selfloop transitions, 27 changer transitions 0/92 dead transitions. [2024-06-20 18:37:13,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 632 flow [2024-06-20 18:37:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:37:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:37:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-20 18:37:13,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817073170731707 [2024-06-20 18:37:13,968 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 296 flow. Second operand 8 states and 158 transitions. [2024-06-20 18:37:13,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 632 flow [2024-06-20 18:37:13,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 584 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-20 18:37:13,974 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 376 flow [2024-06-20 18:37:13,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2024-06-20 18:37:13,975 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2024-06-20 18:37:13,975 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 376 flow [2024-06-20 18:37:13,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 18:37:13,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:13,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:13,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 18:37:13,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:37:13,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash -973842876, now seen corresponding path program 3 times [2024-06-20 18:37:13,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876166185] [2024-06-20 18:37:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:24,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:24,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876166185] [2024-06-20 18:37:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876166185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:24,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:37:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911189645] [2024-06-20 18:37:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:24,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:37:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:37:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:37:24,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:37:24,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 18:37:24,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:24,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:37:24,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:25,864 INFO L124 PetriNetUnfolderBase]: 1301/2011 cut-off events. [2024-06-20 18:37:25,864 INFO L125 PetriNetUnfolderBase]: For 8025/8025 co-relation queries the response was YES. [2024-06-20 18:37:25,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7427 conditions, 2011 events. 1301/2011 cut-off events. For 8025/8025 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9652 event pairs, 442 based on Foata normal form. 4/2014 useless extension candidates. Maximal degree in co-relation 7405. Up to 1789 conditions per place. [2024-06-20 18:37:25,874 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 27 changer transitions 0/94 dead transitions. [2024-06-20 18:37:25,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 638 flow [2024-06-20 18:37:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:37:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:37:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-20 18:37:25,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46612466124661245 [2024-06-20 18:37:25,876 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 376 flow. Second operand 9 states and 172 transitions. [2024-06-20 18:37:25,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 638 flow [2024-06-20 18:37:25,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 584 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-20 18:37:25,882 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 384 flow [2024-06-20 18:37:25,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=384, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-06-20 18:37:25,883 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-20 18:37:25,883 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 384 flow [2024-06-20 18:37:25,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-20 18:37:25,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:25,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:25,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 18:37:25,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:37:25,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -973596612, now seen corresponding path program 1 times [2024-06-20 18:37:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:25,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708884097] [2024-06-20 18:37:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:36,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:36,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708884097] [2024-06-20 18:37:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708884097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:36,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:37:36,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811688954] [2024-06-20 18:37:36,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:36,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:37:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:36,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:37:36,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:37:36,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:37:36,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 384 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:36,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:36,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:37:36,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:37,126 INFO L124 PetriNetUnfolderBase]: 1123/1812 cut-off events. [2024-06-20 18:37:37,127 INFO L125 PetriNetUnfolderBase]: For 7722/7722 co-relation queries the response was YES. [2024-06-20 18:37:37,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6752 conditions, 1812 events. 1123/1812 cut-off events. For 7722/7722 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8996 event pairs, 386 based on Foata normal form. 4/1802 useless extension candidates. Maximal degree in co-relation 6728. Up to 1649 conditions per place. [2024-06-20 18:37:37,135 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 66 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2024-06-20 18:37:37,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 633 flow [2024-06-20 18:37:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:37:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:37:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-20 18:37:37,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-20 18:37:37,137 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 384 flow. Second operand 7 states and 135 transitions. [2024-06-20 18:37:37,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 633 flow [2024-06-20 18:37:37,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 558 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 18:37:37,142 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 393 flow [2024-06-20 18:37:37,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=393, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-06-20 18:37:37,143 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-06-20 18:37:37,143 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 393 flow [2024-06-20 18:37:37,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:37,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:37,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:37,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 18:37:37,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:37:37,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1755840252, now seen corresponding path program 1 times [2024-06-20 18:37:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:37,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173000267] [2024-06-20 18:37:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:37:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:37:48,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:37:48,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173000267] [2024-06-20 18:37:48,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173000267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:37:48,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:37:48,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:37:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457774759] [2024-06-20 18:37:48,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:37:48,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:37:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:37:48,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:37:48,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:37:48,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 18:37:48,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:48,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:37:48,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 18:37:48,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:37:48,858 INFO L124 PetriNetUnfolderBase]: 1015/1693 cut-off events. [2024-06-20 18:37:48,858 INFO L125 PetriNetUnfolderBase]: For 8826/8831 co-relation queries the response was YES. [2024-06-20 18:37:48,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6638 conditions, 1693 events. 1015/1693 cut-off events. For 8826/8831 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8709 event pairs, 395 based on Foata normal form. 6/1691 useless extension candidates. Maximal degree in co-relation 6612. Up to 1528 conditions per place. [2024-06-20 18:37:48,866 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 58 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2024-06-20 18:37:48,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 563 flow [2024-06-20 18:37:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:37:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:37:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-06-20 18:37:48,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48292682926829267 [2024-06-20 18:37:48,869 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 393 flow. Second operand 5 states and 99 transitions. [2024-06-20 18:37:48,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 563 flow [2024-06-20 18:37:48,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 76 transitions, 524 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-20 18:37:48,881 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 400 flow [2024-06-20 18:37:48,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=400, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2024-06-20 18:37:48,882 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-20 18:37:48,882 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 400 flow [2024-06-20 18:37:48,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:37:48,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:37:48,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:37:48,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 18:37:48,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:37:48,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:37:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1403528160, now seen corresponding path program 1 times [2024-06-20 18:37:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:37:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92312709] [2024-06-20 18:37:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:37:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:37:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:38:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92312709] [2024-06-20 18:38:02,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92312709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:02,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:02,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:38:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261129314] [2024-06-20 18:38:02,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:02,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:38:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:02,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:38:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:38:02,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 18:38:02,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 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-20 18:38:02,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:02,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 18:38:02,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:02,876 INFO L124 PetriNetUnfolderBase]: 1012/1689 cut-off events. [2024-06-20 18:38:02,876 INFO L125 PetriNetUnfolderBase]: For 10107/10112 co-relation queries the response was YES. [2024-06-20 18:38:02,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6901 conditions, 1689 events. 1012/1689 cut-off events. For 10107/10112 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8695 event pairs, 394 based on Foata normal form. 6/1687 useless extension candidates. Maximal degree in co-relation 6874. Up to 1521 conditions per place. [2024-06-20 18:38:02,886 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 59 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2024-06-20 18:38:02,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 80 transitions, 584 flow [2024-06-20 18:38:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:38:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:38:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-20 18:38:02,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46747967479674796 [2024-06-20 18:38:02,888 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 400 flow. Second operand 6 states and 115 transitions. [2024-06-20 18:38:02,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 80 transitions, 584 flow [2024-06-20 18:38:02,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 80 transitions, 560 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-20 18:38:02,897 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 432 flow [2024-06-20 18:38:02,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2024-06-20 18:38:02,898 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2024-06-20 18:38:02,898 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 432 flow [2024-06-20 18:38:02,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 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-20 18:38:02,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:02,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:02,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 18:38:02,899 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:02,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1030818789, now seen corresponding path program 1 times [2024-06-20 18:38:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:02,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460115090] [2024-06-20 18:38:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:38:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460115090] [2024-06-20 18:38:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460115090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:13,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:38:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075759246] [2024-06-20 18:38:13,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:13,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:38:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:38:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:38:13,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:38:13,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 432 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:38:13,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:13,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:38:13,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:14,910 INFO L124 PetriNetUnfolderBase]: 1453/2268 cut-off events. [2024-06-20 18:38:14,911 INFO L125 PetriNetUnfolderBase]: For 17285/17285 co-relation queries the response was YES. [2024-06-20 18:38:14,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9916 conditions, 2268 events. 1453/2268 cut-off events. For 17285/17285 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11310 event pairs, 399 based on Foata normal form. 16/2283 useless extension candidates. Maximal degree in co-relation 9888. Up to 1861 conditions per place. [2024-06-20 18:38:14,923 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 95 selfloop transitions, 18 changer transitions 0/118 dead transitions. [2024-06-20 18:38:14,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 118 transitions, 870 flow [2024-06-20 18:38:14,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:38:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:38:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-20 18:38:14,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823848238482385 [2024-06-20 18:38:14,928 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 432 flow. Second operand 9 states and 178 transitions. [2024-06-20 18:38:14,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 118 transitions, 870 flow [2024-06-20 18:38:14,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 836 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 18:38:14,942 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 478 flow [2024-06-20 18:38:14,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=478, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2024-06-20 18:38:14,943 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2024-06-20 18:38:14,944 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 478 flow [2024-06-20 18:38:14,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:38:14,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:14,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:14,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 18:38:14,945 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:14,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1030879239, now seen corresponding path program 2 times [2024-06-20 18:38:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759798868] [2024-06-20 18:38:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:38:25,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:25,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759798868] [2024-06-20 18:38:25,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759798868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:25,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:25,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:38:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051895739] [2024-06-20 18:38:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:25,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:38:25,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:38:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:38:25,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:38:25,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:38:25,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:25,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:38:25,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:26,935 INFO L124 PetriNetUnfolderBase]: 1417/2208 cut-off events. [2024-06-20 18:38:26,935 INFO L125 PetriNetUnfolderBase]: For 18625/18625 co-relation queries the response was YES. [2024-06-20 18:38:26,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9765 conditions, 2208 events. 1417/2208 cut-off events. For 18625/18625 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10852 event pairs, 503 based on Foata normal form. 20/2227 useless extension candidates. Maximal degree in co-relation 9736. Up to 1973 conditions per place. [2024-06-20 18:38:26,944 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 88 selfloop transitions, 15 changer transitions 0/108 dead transitions. [2024-06-20 18:38:26,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 108 transitions, 788 flow [2024-06-20 18:38:26,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:38:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:38:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-20 18:38:26,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2024-06-20 18:38:26,945 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 478 flow. Second operand 8 states and 156 transitions. [2024-06-20 18:38:26,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 108 transitions, 788 flow [2024-06-20 18:38:26,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 108 transitions, 750 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 18:38:26,955 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 477 flow [2024-06-20 18:38:26,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=477, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-06-20 18:38:26,957 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-20 18:38:26,957 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 477 flow [2024-06-20 18:38:26,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:38:26,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:26,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:26,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 18:38:26,958 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:26,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1148966919, now seen corresponding path program 3 times [2024-06-20 18:38:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116960351] [2024-06-20 18:38:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:38:37,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:37,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116960351] [2024-06-20 18:38:37,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116960351] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:37,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:38:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380042219] [2024-06-20 18:38:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:37,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:38:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:38:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:38:37,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:38:37,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 477 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:38:37,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:37,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:38:37,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:38,617 INFO L124 PetriNetUnfolderBase]: 1492/2341 cut-off events. [2024-06-20 18:38:38,617 INFO L125 PetriNetUnfolderBase]: For 21411/21411 co-relation queries the response was YES. [2024-06-20 18:38:38,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10441 conditions, 2341 events. 1492/2341 cut-off events. For 21411/21411 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11836 event pairs, 463 based on Foata normal form. 20/2359 useless extension candidates. Maximal degree in co-relation 10410. Up to 1993 conditions per place. [2024-06-20 18:38:38,628 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 85 selfloop transitions, 31 changer transitions 0/121 dead transitions. [2024-06-20 18:38:38,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 869 flow [2024-06-20 18:38:38,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:38:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:38:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-20 18:38:38,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48292682926829267 [2024-06-20 18:38:38,637 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 477 flow. Second operand 10 states and 198 transitions. [2024-06-20 18:38:38,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 869 flow [2024-06-20 18:38:38,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 121 transitions, 834 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-20 18:38:38,656 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 533 flow [2024-06-20 18:38:38,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=533, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2024-06-20 18:38:38,658 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-20 18:38:38,658 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 533 flow [2024-06-20 18:38:38,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:38:38,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:38,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:38,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 18:38:38,659 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:38,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:38,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2102522711, now seen corresponding path program 1 times [2024-06-20 18:38:38,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:38,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905283320] [2024-06-20 18:38:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:38:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:38:47,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:38:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905283320] [2024-06-20 18:38:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905283320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:38:47,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:38:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:38:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009591249] [2024-06-20 18:38:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:38:47,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:38:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:38:47,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:38:47,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:38:48,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:38:48,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 533 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:38:48,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:38:48,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:38:48,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:38:49,259 INFO L124 PetriNetUnfolderBase]: 1509/2383 cut-off events. [2024-06-20 18:38:49,259 INFO L125 PetriNetUnfolderBase]: For 23396/23396 co-relation queries the response was YES. [2024-06-20 18:38:49,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10854 conditions, 2383 events. 1509/2383 cut-off events. For 23396/23396 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12203 event pairs, 488 based on Foata normal form. 4/2385 useless extension candidates. Maximal degree in co-relation 10822. Up to 2201 conditions per place. [2024-06-20 18:38:49,270 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 79 selfloop transitions, 23 changer transitions 0/107 dead transitions. [2024-06-20 18:38:49,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 107 transitions, 856 flow [2024-06-20 18:38:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:38:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:38:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-20 18:38:49,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46646341463414637 [2024-06-20 18:38:49,273 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 533 flow. Second operand 8 states and 153 transitions. [2024-06-20 18:38:49,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 107 transitions, 856 flow [2024-06-20 18:38:49,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 107 transitions, 785 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 18:38:49,292 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 572 flow [2024-06-20 18:38:49,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=572, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2024-06-20 18:38:49,293 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-20 18:38:49,293 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 572 flow [2024-06-20 18:38:49,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:38:49,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:38:49,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:38:49,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 18:38:49,294 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:38:49,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:38:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash 49558087, now seen corresponding path program 1 times [2024-06-20 18:38:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:38:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790973986] [2024-06-20 18:38:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:38:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:38:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:00,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:00,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790973986] [2024-06-20 18:39:00,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790973986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:00,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:00,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:39:00,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971241291] [2024-06-20 18:39:00,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:00,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:39:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:39:00,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:39:00,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:39:00,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 572 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:00,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:00,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:39:00,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:01,155 INFO L124 PetriNetUnfolderBase]: 1407/2272 cut-off events. [2024-06-20 18:39:01,155 INFO L125 PetriNetUnfolderBase]: For 25386/25386 co-relation queries the response was YES. [2024-06-20 18:39:01,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10769 conditions, 2272 events. 1407/2272 cut-off events. For 25386/25386 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11991 event pairs, 481 based on Foata normal form. 2/2264 useless extension candidates. Maximal degree in co-relation 10735. Up to 2100 conditions per place. [2024-06-20 18:39:01,166 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 73 selfloop transitions, 13 changer transitions 0/97 dead transitions. [2024-06-20 18:39:01,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 97 transitions, 806 flow [2024-06-20 18:39:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:39:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:39:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-20 18:39:01,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-20 18:39:01,167 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 572 flow. Second operand 6 states and 116 transitions. [2024-06-20 18:39:01,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 97 transitions, 806 flow [2024-06-20 18:39:01,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 97 transitions, 741 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 18:39:01,182 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 570 flow [2024-06-20 18:39:01,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-06-20 18:39:01,183 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2024-06-20 18:39:01,183 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 570 flow [2024-06-20 18:39:01,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:01,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:01,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:01,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 18:39:01,184 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:01,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 439904259, now seen corresponding path program 4 times [2024-06-20 18:39:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512503212] [2024-06-20 18:39:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:11,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512503212] [2024-06-20 18:39:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512503212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:11,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:11,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:39:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52340259] [2024-06-20 18:39:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:11,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:39:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:11,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:39:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:39:11,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:39:11,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 570 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:39:11,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:11,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:39:11,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:12,860 INFO L124 PetriNetUnfolderBase]: 1544/2433 cut-off events. [2024-06-20 18:39:12,860 INFO L125 PetriNetUnfolderBase]: For 29797/29801 co-relation queries the response was YES. [2024-06-20 18:39:12,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11702 conditions, 2433 events. 1544/2433 cut-off events. For 29797/29801 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12421 event pairs, 461 based on Foata normal form. 24/2456 useless extension candidates. Maximal degree in co-relation 11667. Up to 2081 conditions per place. [2024-06-20 18:39:12,873 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 87 selfloop transitions, 33 changer transitions 0/125 dead transitions. [2024-06-20 18:39:12,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 125 transitions, 968 flow [2024-06-20 18:39:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:39:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:39:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-20 18:39:12,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682926829268293 [2024-06-20 18:39:12,876 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 570 flow. Second operand 10 states and 192 transitions. [2024-06-20 18:39:12,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 125 transitions, 968 flow [2024-06-20 18:39:12,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 125 transitions, 929 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-20 18:39:12,893 INFO L231 Difference]: Finished difference. Result has 89 places, 83 transitions, 630 flow [2024-06-20 18:39:12,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=630, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2024-06-20 18:39:12,894 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-20 18:39:12,894 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 630 flow [2024-06-20 18:39:12,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:39:12,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:12,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:12,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 18:39:12,895 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:12,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2131153497, now seen corresponding path program 2 times [2024-06-20 18:39:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601924878] [2024-06-20 18:39:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:12,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:22,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601924878] [2024-06-20 18:39:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601924878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:22,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:22,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:39:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421977153] [2024-06-20 18:39:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:22,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:39:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:22,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:39:22,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:39:22,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:39:22,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 630 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:39:22,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:22,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:39:22,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:23,577 INFO L124 PetriNetUnfolderBase]: 1572/2491 cut-off events. [2024-06-20 18:39:23,577 INFO L125 PetriNetUnfolderBase]: For 31730/31734 co-relation queries the response was YES. [2024-06-20 18:39:23,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12231 conditions, 2491 events. 1572/2491 cut-off events. For 31730/31734 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12884 event pairs, 504 based on Foata normal form. 8/2498 useless extension candidates. Maximal degree in co-relation 12195. Up to 2301 conditions per place. [2024-06-20 18:39:23,588 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 81 selfloop transitions, 29 changer transitions 0/115 dead transitions. [2024-06-20 18:39:23,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 115 transitions, 990 flow [2024-06-20 18:39:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:39:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:39:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 18:39:23,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 18:39:23,591 INFO L175 Difference]: Start difference. First operand has 89 places, 83 transitions, 630 flow. Second operand 8 states and 149 transitions. [2024-06-20 18:39:23,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 115 transitions, 990 flow [2024-06-20 18:39:23,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 115 transitions, 905 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-20 18:39:23,613 INFO L231 Difference]: Finished difference. Result has 90 places, 91 transitions, 706 flow [2024-06-20 18:39:23,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=90, PETRI_TRANSITIONS=91} [2024-06-20 18:39:23,614 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2024-06-20 18:39:23,614 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 706 flow [2024-06-20 18:39:23,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:39:23,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:23,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:23,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 18:39:23,614 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:23,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash 676560987, now seen corresponding path program 3 times [2024-06-20 18:39:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:23,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551290146] [2024-06-20 18:39:23,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:33,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551290146] [2024-06-20 18:39:33,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551290146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:33,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:33,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:39:33,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426616492] [2024-06-20 18:39:33,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:33,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:39:33,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:39:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:39:33,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:39:33,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 706 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:39:33,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:33,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:39:33,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:34,432 INFO L124 PetriNetUnfolderBase]: 1630/2596 cut-off events. [2024-06-20 18:39:34,433 INFO L125 PetriNetUnfolderBase]: For 34932/34934 co-relation queries the response was YES. [2024-06-20 18:39:34,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12968 conditions, 2596 events. 1630/2596 cut-off events. For 34932/34934 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13616 event pairs, 418 based on Foata normal form. 4/2598 useless extension candidates. Maximal degree in co-relation 12930. Up to 2191 conditions per place. [2024-06-20 18:39:34,447 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 79 selfloop transitions, 45 changer transitions 0/129 dead transitions. [2024-06-20 18:39:34,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 129 transitions, 1216 flow [2024-06-20 18:39:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:39:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:39:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-20 18:39:34,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817073170731707 [2024-06-20 18:39:34,451 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 706 flow. Second operand 8 states and 158 transitions. [2024-06-20 18:39:34,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 129 transitions, 1216 flow [2024-06-20 18:39:34,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 1151 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-20 18:39:34,481 INFO L231 Difference]: Finished difference. Result has 97 places, 99 transitions, 883 flow [2024-06-20 18:39:34,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=883, PETRI_PLACES=97, PETRI_TRANSITIONS=99} [2024-06-20 18:39:34,482 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2024-06-20 18:39:34,482 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 883 flow [2024-06-20 18:39:34,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:39:34,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:34,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:34,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 18:39:34,485 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:34,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:34,485 INFO L85 PathProgramCache]: Analyzing trace with hash 440088957, now seen corresponding path program 4 times [2024-06-20 18:39:34,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898030438] [2024-06-20 18:39:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898030438] [2024-06-20 18:39:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898030438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:43,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:39:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164950963] [2024-06-20 18:39:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:43,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:39:43,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:43,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:39:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:39:44,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:39:44,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 883 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:39:44,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:44,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:39:44,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:45,126 INFO L124 PetriNetUnfolderBase]: 1622/2574 cut-off events. [2024-06-20 18:39:45,126 INFO L125 PetriNetUnfolderBase]: For 37548/37550 co-relation queries the response was YES. [2024-06-20 18:39:45,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13162 conditions, 2574 events. 1622/2574 cut-off events. For 37548/37550 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13384 event pairs, 486 based on Foata normal form. 4/2576 useless extension candidates. Maximal degree in co-relation 13121. Up to 2354 conditions per place. [2024-06-20 18:39:45,140 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 83 selfloop transitions, 35 changer transitions 0/123 dead transitions. [2024-06-20 18:39:45,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 123 transitions, 1179 flow [2024-06-20 18:39:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:39:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:39:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 18:39:45,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 18:39:45,143 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 883 flow. Second operand 8 states and 152 transitions. [2024-06-20 18:39:45,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 123 transitions, 1179 flow [2024-06-20 18:39:45,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 123 transitions, 1127 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-06-20 18:39:45,182 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 908 flow [2024-06-20 18:39:45,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=908, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2024-06-20 18:39:45,183 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2024-06-20 18:39:45,183 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 908 flow [2024-06-20 18:39:45,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-20 18:39:45,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:45,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:45,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 18:39:45,184 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:45,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash 60985927, now seen corresponding path program 2 times [2024-06-20 18:39:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336375254] [2024-06-20 18:39:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:39:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:39:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:39:55,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336375254] [2024-06-20 18:39:55,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336375254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:39:55,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:39:55,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:39:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761644469] [2024-06-20 18:39:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:39:55,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:39:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:39:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:39:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:39:56,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:39:56,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 908 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:56,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:39:56,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:39:56,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:39:56,955 INFO L124 PetriNetUnfolderBase]: 1504/2455 cut-off events. [2024-06-20 18:39:56,955 INFO L125 PetriNetUnfolderBase]: For 39672/39672 co-relation queries the response was YES. [2024-06-20 18:39:56,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12576 conditions, 2455 events. 1504/2455 cut-off events. For 39672/39672 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13223 event pairs, 466 based on Foata normal form. 2/2447 useless extension candidates. Maximal degree in co-relation 12533. Up to 2252 conditions per place. [2024-06-20 18:39:56,968 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 83 selfloop transitions, 19 changer transitions 0/118 dead transitions. [2024-06-20 18:39:56,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 118 transitions, 1182 flow [2024-06-20 18:39:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:39:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:39:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-20 18:39:56,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45993031358885017 [2024-06-20 18:39:56,969 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 908 flow. Second operand 7 states and 132 transitions. [2024-06-20 18:39:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 118 transitions, 1182 flow [2024-06-20 18:39:56,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 118 transitions, 1069 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 18:39:56,989 INFO L231 Difference]: Finished difference. Result has 102 places, 102 transitions, 875 flow [2024-06-20 18:39:56,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=875, PETRI_PLACES=102, PETRI_TRANSITIONS=102} [2024-06-20 18:39:56,990 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2024-06-20 18:39:56,990 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 102 transitions, 875 flow [2024-06-20 18:39:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:39:56,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:39:56,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:39:56,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 18:39:56,991 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:39:56,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:39:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 55277959, now seen corresponding path program 1 times [2024-06-20 18:39:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:39:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934199104] [2024-06-20 18:39:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:39:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:39:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:40:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:40:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:40:07,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934199104] [2024-06-20 18:40:07,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934199104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:40:07,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:40:07,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:40:07,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512179117] [2024-06-20 18:40:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:40:07,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:40:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:40:07,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:40:07,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:40:07,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:40:07,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:07,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:40:07,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:40:07,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:40:08,411 INFO L124 PetriNetUnfolderBase]: 1459/2392 cut-off events. [2024-06-20 18:40:08,412 INFO L125 PetriNetUnfolderBase]: For 36050/36050 co-relation queries the response was YES. [2024-06-20 18:40:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12188 conditions, 2392 events. 1459/2392 cut-off events. For 36050/36050 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12793 event pairs, 404 based on Foata normal form. 2/2393 useless extension candidates. Maximal degree in co-relation 12146. Up to 2233 conditions per place. [2024-06-20 18:40:08,422 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 101 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2024-06-20 18:40:08,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 118 transitions, 1163 flow [2024-06-20 18:40:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:40:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:40:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-20 18:40:08,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 18:40:08,423 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 875 flow. Second operand 6 states and 114 transitions. [2024-06-20 18:40:08,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 118 transitions, 1163 flow [2024-06-20 18:40:08,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 118 transitions, 1105 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 18:40:08,448 INFO L231 Difference]: Finished difference. Result has 103 places, 105 transitions, 881 flow [2024-06-20 18:40:08,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=881, PETRI_PLACES=103, PETRI_TRANSITIONS=105} [2024-06-20 18:40:08,449 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2024-06-20 18:40:08,449 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 105 transitions, 881 flow [2024-06-20 18:40:08,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:08,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:40:08,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:40:08,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 18:40:08,449 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:40:08,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:40:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 559693219, now seen corresponding path program 2 times [2024-06-20 18:40:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:40:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054941489] [2024-06-20 18:40:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:40:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:40:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:40:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:40:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:40:19,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054941489] [2024-06-20 18:40:19,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054941489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:40:19,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:40:19,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:40:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227852686] [2024-06-20 18:40:19,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:40:19,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:40:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:40:19,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:40:19,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:40:19,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:40:19,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 105 transitions, 881 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:19,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:40:19,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:40:19,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:40:19,947 INFO L124 PetriNetUnfolderBase]: 1461/2398 cut-off events. [2024-06-20 18:40:19,947 INFO L125 PetriNetUnfolderBase]: For 38578/38580 co-relation queries the response was YES. [2024-06-20 18:40:19,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12528 conditions, 2398 events. 1461/2398 cut-off events. For 38578/38580 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12850 event pairs, 408 based on Foata normal form. 4/2401 useless extension candidates. Maximal degree in co-relation 12485. Up to 2227 conditions per place. [2024-06-20 18:40:19,958 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 97 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2024-06-20 18:40:19,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 119 transitions, 1173 flow [2024-06-20 18:40:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:40:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:40:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-20 18:40:19,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-20 18:40:19,960 INFO L175 Difference]: Start difference. First operand has 103 places, 105 transitions, 881 flow. Second operand 6 states and 114 transitions. [2024-06-20 18:40:19,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 119 transitions, 1173 flow [2024-06-20 18:40:19,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 119 transitions, 1131 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-20 18:40:19,984 INFO L231 Difference]: Finished difference. Result has 105 places, 108 transitions, 919 flow [2024-06-20 18:40:19,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=105, PETRI_TRANSITIONS=108} [2024-06-20 18:40:19,985 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-20 18:40:19,985 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 919 flow [2024-06-20 18:40:19,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:40:19,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:40:19,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:40:19,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 18:40:19,986 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:40:19,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:40:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1263962901, now seen corresponding path program 1 times [2024-06-20 18:40:19,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:40:19,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773137359] [2024-06-20 18:40:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:40:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:40:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:40:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:40:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:40:29,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773137359] [2024-06-20 18:40:29,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773137359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:40:29,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:40:29,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:40:29,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558976601] [2024-06-20 18:40:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:40:29,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:40:29,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:40:29,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:40:29,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:40:30,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:40:30,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 919 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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-20 18:40:30,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:40:30,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:40:30,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:40:31,354 INFO L124 PetriNetUnfolderBase]: 1710/2750 cut-off events. [2024-06-20 18:40:31,354 INFO L125 PetriNetUnfolderBase]: For 53700/53700 co-relation queries the response was YES. [2024-06-20 18:40:31,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14965 conditions, 2750 events. 1710/2750 cut-off events. For 53700/53700 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14889 event pairs, 481 based on Foata normal form. 12/2761 useless extension candidates. Maximal degree in co-relation 14921. Up to 2201 conditions per place. [2024-06-20 18:40:31,369 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 110 selfloop transitions, 44 changer transitions 0/159 dead transitions. [2024-06-20 18:40:31,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 159 transitions, 1433 flow [2024-06-20 18:40:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:40:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:40:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2024-06-20 18:40:31,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656319290465632 [2024-06-20 18:40:31,372 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 919 flow. Second operand 11 states and 210 transitions. [2024-06-20 18:40:31,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 159 transitions, 1433 flow [2024-06-20 18:40:31,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 159 transitions, 1375 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-20 18:40:31,412 INFO L231 Difference]: Finished difference. Result has 114 places, 113 transitions, 1040 flow [2024-06-20 18:40:31,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1040, PETRI_PLACES=114, PETRI_TRANSITIONS=113} [2024-06-20 18:40:31,413 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places. [2024-06-20 18:40:31,413 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 113 transitions, 1040 flow [2024-06-20 18:40:31,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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-20 18:40:31,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:40:31,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:40:31,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 18:40:31,414 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:40:31,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:40:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash 158472767, now seen corresponding path program 1 times [2024-06-20 18:40:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:40:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997015263] [2024-06-20 18:40:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:40:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:40:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:40:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:40:44,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:40:44,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997015263] [2024-06-20 18:40:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997015263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:40:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:40:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:40:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25975924] [2024-06-20 18:40:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:40:44,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:40:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:40:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:40:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:40:44,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:40:44,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 113 transitions, 1040 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:40:44,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:40:44,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:40:44,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:40:45,427 INFO L124 PetriNetUnfolderBase]: 1609/2655 cut-off events. [2024-06-20 18:40:45,427 INFO L125 PetriNetUnfolderBase]: For 56546/56546 co-relation queries the response was YES. [2024-06-20 18:40:45,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15037 conditions, 2655 events. 1609/2655 cut-off events. For 56546/56546 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14797 event pairs, 499 based on Foata normal form. 2/2640 useless extension candidates. Maximal degree in co-relation 14990. Up to 2409 conditions per place. [2024-06-20 18:40:45,444 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 100 selfloop transitions, 16 changer transitions 0/132 dead transitions. [2024-06-20 18:40:45,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 132 transitions, 1342 flow [2024-06-20 18:40:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:40:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:40:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-20 18:40:45,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564459930313589 [2024-06-20 18:40:45,446 INFO L175 Difference]: Start difference. First operand has 114 places, 113 transitions, 1040 flow. Second operand 7 states and 131 transitions. [2024-06-20 18:40:45,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 132 transitions, 1342 flow [2024-06-20 18:40:45,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 132 transitions, 1264 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-20 18:40:45,487 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 1036 flow [2024-06-20 18:40:45,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1036, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2024-06-20 18:40:45,487 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2024-06-20 18:40:45,488 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 1036 flow [2024-06-20 18:40:45,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:40:45,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:40:45,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:40:45,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 18:40:45,488 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:40:45,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:40:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash 757856921, now seen corresponding path program 2 times [2024-06-20 18:40:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:40:45,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914507315] [2024-06-20 18:40:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:40:45,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:40:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:40:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:40:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:40:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914507315] [2024-06-20 18:40:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914507315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:40:55,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:40:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:40:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707017223] [2024-06-20 18:40:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:40:55,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:40:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:40:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:40:55,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:40:55,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:40:55,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 1036 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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-20 18:40:55,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:40:55,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:40:55,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:40:56,484 INFO L124 PetriNetUnfolderBase]: 1830/2975 cut-off events. [2024-06-20 18:40:56,484 INFO L125 PetriNetUnfolderBase]: For 62563/62565 co-relation queries the response was YES. [2024-06-20 18:40:56,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16713 conditions, 2975 events. 1830/2975 cut-off events. For 62563/62565 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16597 event pairs, 528 based on Foata normal form. 12/2985 useless extension candidates. Maximal degree in co-relation 16665. Up to 2488 conditions per place. [2024-06-20 18:40:56,500 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 107 selfloop transitions, 44 changer transitions 0/156 dead transitions. [2024-06-20 18:40:56,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 156 transitions, 1527 flow [2024-06-20 18:40:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:40:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:40:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-20 18:40:56,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742547425474255 [2024-06-20 18:40:56,503 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 1036 flow. Second operand 9 states and 175 transitions. [2024-06-20 18:40:56,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 156 transitions, 1527 flow [2024-06-20 18:40:56,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 156 transitions, 1475 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 18:40:56,551 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 1171 flow [2024-06-20 18:40:56,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2024-06-20 18:40:56,552 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 79 predicate places. [2024-06-20 18:40:56,552 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 1171 flow [2024-06-20 18:40:56,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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-20 18:40:56,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:40:56,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:40:56,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 18:40:56,553 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:40:56,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:40:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash -767142021, now seen corresponding path program 3 times [2024-06-20 18:40:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:40:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398731827] [2024-06-20 18:40:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:40:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:40:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:41:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:41:07,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:41:07,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398731827] [2024-06-20 18:41:07,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398731827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:41:07,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:41:07,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:41:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640097475] [2024-06-20 18:41:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:41:07,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:41:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:41:07,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:41:07,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:41:07,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:41:07,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 1171 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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-20 18:41:07,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:41:07,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:41:07,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:41:08,705 INFO L124 PetriNetUnfolderBase]: 1912/3127 cut-off events. [2024-06-20 18:41:08,705 INFO L125 PetriNetUnfolderBase]: For 69716/69718 co-relation queries the response was YES. [2024-06-20 18:41:08,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17938 conditions, 3127 events. 1912/3127 cut-off events. For 69716/69718 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 17826 event pairs, 553 based on Foata normal form. 12/3137 useless extension candidates. Maximal degree in co-relation 17887. Up to 2630 conditions per place. [2024-06-20 18:41:08,721 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 106 selfloop transitions, 49 changer transitions 0/160 dead transitions. [2024-06-20 18:41:08,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 160 transitions, 1667 flow [2024-06-20 18:41:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:41:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:41:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-20 18:41:08,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-20 18:41:08,724 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 1171 flow. Second operand 9 states and 174 transitions. [2024-06-20 18:41:08,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 160 transitions, 1667 flow [2024-06-20 18:41:08,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 160 transitions, 1576 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-20 18:41:08,771 INFO L231 Difference]: Finished difference. Result has 127 places, 126 transitions, 1262 flow [2024-06-20 18:41:08,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1262, PETRI_PLACES=127, PETRI_TRANSITIONS=126} [2024-06-20 18:41:08,771 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2024-06-20 18:41:08,771 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 126 transitions, 1262 flow [2024-06-20 18:41:08,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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-20 18:41:08,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:41:08,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:41:08,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 18:41:08,772 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:41:08,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:41:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash -501444741, now seen corresponding path program 4 times [2024-06-20 18:41:08,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:41:08,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967583230] [2024-06-20 18:41:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:41:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:41:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:41:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:41:19,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:41:19,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967583230] [2024-06-20 18:41:19,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967583230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:41:19,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:41:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:41:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027414475] [2024-06-20 18:41:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:41:19,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:41:19,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:41:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:41:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:41:19,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:41:19,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 126 transitions, 1262 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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-20 18:41:19,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:41:19,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:41:19,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:41:20,859 INFO L124 PetriNetUnfolderBase]: 1892/3095 cut-off events. [2024-06-20 18:41:20,859 INFO L125 PetriNetUnfolderBase]: For 70876/70878 co-relation queries the response was YES. [2024-06-20 18:41:20,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17611 conditions, 3095 events. 1892/3095 cut-off events. For 70876/70878 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17586 event pairs, 480 based on Foata normal form. 12/3105 useless extension candidates. Maximal degree in co-relation 17558. Up to 2038 conditions per place. [2024-06-20 18:41:20,878 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 96 selfloop transitions, 59 changer transitions 0/160 dead transitions. [2024-06-20 18:41:20,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 160 transitions, 1650 flow [2024-06-20 18:41:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:41:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:41:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-20 18:41:20,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2024-06-20 18:41:20,880 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 1262 flow. Second operand 9 states and 173 transitions. [2024-06-20 18:41:20,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 160 transitions, 1650 flow [2024-06-20 18:41:20,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 160 transitions, 1556 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-20 18:41:20,930 INFO L231 Difference]: Finished difference. Result has 131 places, 125 transitions, 1248 flow [2024-06-20 18:41:20,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1248, PETRI_PLACES=131, PETRI_TRANSITIONS=125} [2024-06-20 18:41:20,931 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places. [2024-06-20 18:41:20,931 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 125 transitions, 1248 flow [2024-06-20 18:41:20,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 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-20 18:41:20,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:41:20,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:41:20,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 18:41:20,932 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:41:20,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:41:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 170852927, now seen corresponding path program 2 times [2024-06-20 18:41:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:41:20,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473218956] [2024-06-20 18:41:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:41:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:41:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:41:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:41:32,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:41:32,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473218956] [2024-06-20 18:41:32,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473218956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:41:32,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:41:32,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:41:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668403872] [2024-06-20 18:41:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:41:32,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:41:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:41:32,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:41:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:41:32,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-20 18:41:32,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 125 transitions, 1248 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:41:32,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:41:32,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-20 18:41:32,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:41:33,437 INFO L124 PetriNetUnfolderBase]: 1755/2920 cut-off events. [2024-06-20 18:41:33,437 INFO L125 PetriNetUnfolderBase]: For 70763/70769 co-relation queries the response was YES. [2024-06-20 18:41:33,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16987 conditions, 2920 events. 1755/2920 cut-off events. For 70763/70769 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17005 event pairs, 527 based on Foata normal form. 6/2901 useless extension candidates. Maximal degree in co-relation 16933. Up to 2653 conditions per place. [2024-06-20 18:41:33,454 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 100 selfloop transitions, 28 changer transitions 0/144 dead transitions. [2024-06-20 18:41:33,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 144 transitions, 1666 flow [2024-06-20 18:41:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:41:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:41:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-20 18:41:33,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-20 18:41:33,455 INFO L175 Difference]: Start difference. First operand has 131 places, 125 transitions, 1248 flow. Second operand 7 states and 135 transitions. [2024-06-20 18:41:33,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 144 transitions, 1666 flow [2024-06-20 18:41:33,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 144 transitions, 1510 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 18:41:33,502 INFO L231 Difference]: Finished difference. Result has 131 places, 133 transitions, 1255 flow [2024-06-20 18:41:33,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1255, PETRI_PLACES=131, PETRI_TRANSITIONS=133} [2024-06-20 18:41:33,503 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places. [2024-06-20 18:41:33,503 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 133 transitions, 1255 flow [2024-06-20 18:41:33,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:41:33,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:41:33,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:41:33,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 18:41:33,503 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:41:33,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:41:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1890564861, now seen corresponding path program 3 times [2024-06-20 18:41:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:41:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269249409] [2024-06-20 18:41:33,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:41:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:41:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:41:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:41:47,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:41:47,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269249409] [2024-06-20 18:41:47,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269249409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:41:47,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:41:47,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:41:47,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994430404] [2024-06-20 18:41:47,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:41:47,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:41:47,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:41:47,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:41:47,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:41:47,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:41:47,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 133 transitions, 1255 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:41:47,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:41:47,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:41:47,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:41:48,891 INFO L124 PetriNetUnfolderBase]: 1751/2913 cut-off events. [2024-06-20 18:41:48,892 INFO L125 PetriNetUnfolderBase]: For 72668/72674 co-relation queries the response was YES. [2024-06-20 18:41:48,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16907 conditions, 2913 events. 1751/2913 cut-off events. For 72668/72674 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16951 event pairs, 526 based on Foata normal form. 5/2894 useless extension candidates. Maximal degree in co-relation 16852. Up to 2662 conditions per place. [2024-06-20 18:41:48,912 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 107 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2024-06-20 18:41:48,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 144 transitions, 1542 flow [2024-06-20 18:41:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:41:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:41:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 18:41:48,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:41:48,913 INFO L175 Difference]: Start difference. First operand has 131 places, 133 transitions, 1255 flow. Second operand 7 states and 126 transitions. [2024-06-20 18:41:48,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 144 transitions, 1542 flow [2024-06-20 18:41:48,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 144 transitions, 1469 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-20 18:41:48,965 INFO L231 Difference]: Finished difference. Result has 135 places, 134 transitions, 1239 flow [2024-06-20 18:41:48,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1239, PETRI_PLACES=135, PETRI_TRANSITIONS=134} [2024-06-20 18:41:48,965 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-20 18:41:48,966 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 134 transitions, 1239 flow [2024-06-20 18:41:48,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:41:48,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:41:48,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:41:48,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 18:41:48,966 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:41:48,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:41:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1713497697, now seen corresponding path program 1 times [2024-06-20 18:41:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:41:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360957345] [2024-06-20 18:41:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:41:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:41:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:42:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:42:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:42:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360957345] [2024-06-20 18:42:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360957345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:42:01,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:42:01,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:42:01,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006250114] [2024-06-20 18:42:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:42:01,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:42:01,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:42:01,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:42:01,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:42:01,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:42:01,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 134 transitions, 1239 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:42:01,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:42:01,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:42:01,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:42:02,687 INFO L124 PetriNetUnfolderBase]: 1808/3013 cut-off events. [2024-06-20 18:42:02,687 INFO L125 PetriNetUnfolderBase]: For 76456/76456 co-relation queries the response was YES. [2024-06-20 18:42:02,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17397 conditions, 3013 events. 1808/3013 cut-off events. For 76456/76456 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17451 event pairs, 512 based on Foata normal form. 1/3013 useless extension candidates. Maximal degree in co-relation 17340. Up to 2761 conditions per place. [2024-06-20 18:42:02,705 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 129 selfloop transitions, 14 changer transitions 0/153 dead transitions. [2024-06-20 18:42:02,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 153 transitions, 1607 flow [2024-06-20 18:42:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:42:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:42:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-20 18:42:02,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-20 18:42:02,706 INFO L175 Difference]: Start difference. First operand has 135 places, 134 transitions, 1239 flow. Second operand 7 states and 130 transitions. [2024-06-20 18:42:02,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 153 transitions, 1607 flow [2024-06-20 18:42:02,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 153 transitions, 1561 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 18:42:02,757 INFO L231 Difference]: Finished difference. Result has 137 places, 137 transitions, 1275 flow [2024-06-20 18:42:02,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1275, PETRI_PLACES=137, PETRI_TRANSITIONS=137} [2024-06-20 18:42:02,757 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places. [2024-06-20 18:42:02,758 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 137 transitions, 1275 flow [2024-06-20 18:42:02,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:42:02,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:42:02,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:42:02,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 18:42:02,758 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:42:02,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:42:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1713617853, now seen corresponding path program 1 times [2024-06-20 18:42:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:42:02,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175686949] [2024-06-20 18:42:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:42:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:42:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:42:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:42:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:42:14,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175686949] [2024-06-20 18:42:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175686949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:42:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:42:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:42:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649969891] [2024-06-20 18:42:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:42:14,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:42:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:42:14,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:42:14,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:42:15,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:42:15,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 1275 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:42:15,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:42:15,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:42:15,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:42:16,115 INFO L124 PetriNetUnfolderBase]: 1828/3045 cut-off events. [2024-06-20 18:42:16,115 INFO L125 PetriNetUnfolderBase]: For 84139/84139 co-relation queries the response was YES. [2024-06-20 18:42:16,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17975 conditions, 3045 events. 1828/3045 cut-off events. For 84139/84139 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17654 event pairs, 511 based on Foata normal form. 6/3050 useless extension candidates. Maximal degree in co-relation 17917. Up to 2783 conditions per place. [2024-06-20 18:42:16,131 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 131 selfloop transitions, 15 changer transitions 0/156 dead transitions. [2024-06-20 18:42:16,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 156 transitions, 1655 flow [2024-06-20 18:42:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:42:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:42:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-20 18:42:16,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-20 18:42:16,133 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 1275 flow. Second operand 7 states and 130 transitions. [2024-06-20 18:42:16,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 156 transitions, 1655 flow [2024-06-20 18:42:16,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 156 transitions, 1595 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-20 18:42:16,185 INFO L231 Difference]: Finished difference. Result has 139 places, 141 transitions, 1304 flow [2024-06-20 18:42:16,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1304, PETRI_PLACES=139, PETRI_TRANSITIONS=141} [2024-06-20 18:42:16,186 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-20 18:42:16,186 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 141 transitions, 1304 flow [2024-06-20 18:42:16,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:42:16,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:42:16,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:42:16,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 18:42:16,187 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:42:16,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:42:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash 170858879, now seen corresponding path program 2 times [2024-06-20 18:42:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:42:16,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853026070] [2024-06-20 18:42:16,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:42:16,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:42:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:42:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:42:29,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:42:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853026070] [2024-06-20 18:42:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853026070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:42:29,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:42:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:42:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516510454] [2024-06-20 18:42:29,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:42:29,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:42:29,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:42:29,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:42:29,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:42:30,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:42:30,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 141 transitions, 1304 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:42:30,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:42:30,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:42:30,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:42:31,141 INFO L124 PetriNetUnfolderBase]: 1844/3072 cut-off events. [2024-06-20 18:42:31,141 INFO L125 PetriNetUnfolderBase]: For 88903/88905 co-relation queries the response was YES. [2024-06-20 18:42:31,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18756 conditions, 3072 events. 1844/3072 cut-off events. For 88903/88905 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17852 event pairs, 515 based on Foata normal form. 4/3075 useless extension candidates. Maximal degree in co-relation 18697. Up to 2783 conditions per place. [2024-06-20 18:42:31,160 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 123 selfloop transitions, 30 changer transitions 0/163 dead transitions. [2024-06-20 18:42:31,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 163 transitions, 1847 flow [2024-06-20 18:42:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:42:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:42:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-20 18:42:31,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-20 18:42:31,161 INFO L175 Difference]: Start difference. First operand has 139 places, 141 transitions, 1304 flow. Second operand 7 states and 130 transitions. [2024-06-20 18:42:31,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 163 transitions, 1847 flow [2024-06-20 18:42:31,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 163 transitions, 1751 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-20 18:42:31,230 INFO L231 Difference]: Finished difference. Result has 142 places, 151 transitions, 1443 flow [2024-06-20 18:42:31,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1443, PETRI_PLACES=142, PETRI_TRANSITIONS=151} [2024-06-20 18:42:31,231 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places. [2024-06-20 18:42:31,231 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 151 transitions, 1443 flow [2024-06-20 18:42:31,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:42:31,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:42:31,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:42:31,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 18:42:31,231 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:42:31,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:42:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 170621729, now seen corresponding path program 3 times [2024-06-20 18:42:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:42:31,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544728941] [2024-06-20 18:42:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:42:31,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:42:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:42:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:42:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:42:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544728941] [2024-06-20 18:42:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544728941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:42:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:42:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:42:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715782301] [2024-06-20 18:42:43,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:42:43,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:42:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:42:43,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:42:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:42:43,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:42:43,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 151 transitions, 1443 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:42:43,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:42:43,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:42:43,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:42:44,678 INFO L124 PetriNetUnfolderBase]: 1842/3070 cut-off events. [2024-06-20 18:42:44,678 INFO L125 PetriNetUnfolderBase]: For 95943/95945 co-relation queries the response was YES. [2024-06-20 18:42:44,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19283 conditions, 3070 events. 1842/3070 cut-off events. For 95943/95945 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17846 event pairs, 513 based on Foata normal form. 8/3077 useless extension candidates. Maximal degree in co-relation 19222. Up to 2795 conditions per place. [2024-06-20 18:42:44,698 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 135 selfloop transitions, 23 changer transitions 0/168 dead transitions. [2024-06-20 18:42:44,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 168 transitions, 1878 flow [2024-06-20 18:42:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:42:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:42:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-20 18:42:44,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-20 18:42:44,699 INFO L175 Difference]: Start difference. First operand has 142 places, 151 transitions, 1443 flow. Second operand 7 states and 130 transitions. [2024-06-20 18:42:44,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 168 transitions, 1878 flow [2024-06-20 18:42:44,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 168 transitions, 1798 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-20 18:42:44,783 INFO L231 Difference]: Finished difference. Result has 146 places, 155 transitions, 1487 flow [2024-06-20 18:42:44,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1487, PETRI_PLACES=146, PETRI_TRANSITIONS=155} [2024-06-20 18:42:44,784 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-20 18:42:44,784 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 155 transitions, 1487 flow [2024-06-20 18:42:44,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-20 18:42:44,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:42:44,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:42:44,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 18:42:44,785 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:42:44,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:42:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash 170867807, now seen corresponding path program 1 times [2024-06-20 18:42:44,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:42:44,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216099733] [2024-06-20 18:42:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:42:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:42:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:42:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:42:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:42:57,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216099733] [2024-06-20 18:42:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216099733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:42:57,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:42:57,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:42:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259302611] [2024-06-20 18:42:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:42:57,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:42:57,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:42:57,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:42:57,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:42:57,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:42:57,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 155 transitions, 1487 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:42:57,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:42:57,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:42:57,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:42:58,610 INFO L124 PetriNetUnfolderBase]: 1794/2988 cut-off events. [2024-06-20 18:42:58,610 INFO L125 PetriNetUnfolderBase]: For 98513/98517 co-relation queries the response was YES. [2024-06-20 18:42:58,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19600 conditions, 2988 events. 1794/2988 cut-off events. For 98513/98517 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17394 event pairs, 514 based on Foata normal form. 1/2967 useless extension candidates. Maximal degree in co-relation 19537. Up to 2748 conditions per place. [2024-06-20 18:42:58,629 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 136 selfloop transitions, 17 changer transitions 0/169 dead transitions. [2024-06-20 18:42:58,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 169 transitions, 1869 flow [2024-06-20 18:42:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:42:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:42:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-20 18:42:58,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-20 18:42:58,630 INFO L175 Difference]: Start difference. First operand has 146 places, 155 transitions, 1487 flow. Second operand 8 states and 139 transitions. [2024-06-20 18:42:58,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 169 transitions, 1869 flow [2024-06-20 18:42:58,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 169 transitions, 1781 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-20 18:42:58,698 INFO L231 Difference]: Finished difference. Result has 149 places, 158 transitions, 1495 flow [2024-06-20 18:42:58,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1495, PETRI_PLACES=149, PETRI_TRANSITIONS=158} [2024-06-20 18:42:58,699 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-20 18:42:58,699 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 158 transitions, 1495 flow [2024-06-20 18:42:58,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:42:58,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:42:58,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:42:58,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 18:42:58,700 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:42:58,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:42:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash 636236680, now seen corresponding path program 1 times [2024-06-20 18:42:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:42:58,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199356251] [2024-06-20 18:42:58,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:42:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:42:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:43:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:43:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:43:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199356251] [2024-06-20 18:43:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199356251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:43:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:43:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:43:09,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14634588] [2024-06-20 18:43:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:43:09,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:43:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:43:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:43:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:43:09,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:43:09,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 158 transitions, 1495 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:09,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:43:09,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:43:09,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:43:10,645 INFO L124 PetriNetUnfolderBase]: 1954/3187 cut-off events. [2024-06-20 18:43:10,646 INFO L125 PetriNetUnfolderBase]: For 104250/104252 co-relation queries the response was YES. [2024-06-20 18:43:10,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20763 conditions, 3187 events. 1954/3187 cut-off events. For 104250/104252 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18152 event pairs, 539 based on Foata normal form. 4/3190 useless extension candidates. Maximal degree in co-relation 20699. Up to 2983 conditions per place. [2024-06-20 18:43:10,668 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 157 selfloop transitions, 19 changer transitions 0/181 dead transitions. [2024-06-20 18:43:10,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 181 transitions, 1957 flow [2024-06-20 18:43:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:43:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:43:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-20 18:43:10,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-20 18:43:10,669 INFO L175 Difference]: Start difference. First operand has 149 places, 158 transitions, 1495 flow. Second operand 7 states and 130 transitions. [2024-06-20 18:43:10,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 181 transitions, 1957 flow [2024-06-20 18:43:10,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 181 transitions, 1853 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-20 18:43:10,741 INFO L231 Difference]: Finished difference. Result has 149 places, 161 transitions, 1487 flow [2024-06-20 18:43:10,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1487, PETRI_PLACES=149, PETRI_TRANSITIONS=161} [2024-06-20 18:43:10,741 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places. [2024-06-20 18:43:10,741 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 161 transitions, 1487 flow [2024-06-20 18:43:10,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:10,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:43:10,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:43:10,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 18:43:10,742 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:43:10,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:43:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1475961584, now seen corresponding path program 2 times [2024-06-20 18:43:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:43:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774255066] [2024-06-20 18:43:10,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:43:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:43:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:43:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:43:21,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:43:21,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774255066] [2024-06-20 18:43:21,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774255066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:43:21,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:43:21,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:43:21,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191890898] [2024-06-20 18:43:21,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:43:21,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:43:21,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:43:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:43:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:43:21,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:43:21,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 161 transitions, 1487 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:21,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:43:21,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:43:21,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:43:22,663 INFO L124 PetriNetUnfolderBase]: 1980/3227 cut-off events. [2024-06-20 18:43:22,663 INFO L125 PetriNetUnfolderBase]: For 112258/112260 co-relation queries the response was YES. [2024-06-20 18:43:22,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21538 conditions, 3227 events. 1980/3227 cut-off events. For 112258/112260 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18411 event pairs, 540 based on Foata normal form. 4/3230 useless extension candidates. Maximal degree in co-relation 21474. Up to 3001 conditions per place. [2024-06-20 18:43:22,743 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 157 selfloop transitions, 26 changer transitions 0/188 dead transitions. [2024-06-20 18:43:22,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 188 transitions, 2114 flow [2024-06-20 18:43:22,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:43:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:43:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-20 18:43:22,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-20 18:43:22,744 INFO L175 Difference]: Start difference. First operand has 149 places, 161 transitions, 1487 flow. Second operand 7 states and 130 transitions. [2024-06-20 18:43:22,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 188 transitions, 2114 flow [2024-06-20 18:43:22,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 188 transitions, 2054 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-20 18:43:22,817 INFO L231 Difference]: Finished difference. Result has 153 places, 169 transitions, 1621 flow [2024-06-20 18:43:22,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1621, PETRI_PLACES=153, PETRI_TRANSITIONS=169} [2024-06-20 18:43:22,817 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places. [2024-06-20 18:43:22,817 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 169 transitions, 1621 flow [2024-06-20 18:43:22,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:22,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:43:22,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:43:22,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 18:43:22,818 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:43:22,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:43:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1475969520, now seen corresponding path program 1 times [2024-06-20 18:43:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:43:22,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462355588] [2024-06-20 18:43:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:43:22,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:43:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:43:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:43:36,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:43:36,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462355588] [2024-06-20 18:43:36,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462355588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:43:36,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:43:36,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:43:36,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746972030] [2024-06-20 18:43:36,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:43:36,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:43:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:43:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:43:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:43:36,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:43:36,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 169 transitions, 1621 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:36,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:43:36,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:43:36,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:43:37,616 INFO L124 PetriNetUnfolderBase]: 1849/3069 cut-off events. [2024-06-20 18:43:37,616 INFO L125 PetriNetUnfolderBase]: For 117589/117599 co-relation queries the response was YES. [2024-06-20 18:43:37,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21246 conditions, 3069 events. 1849/3069 cut-off events. For 117589/117599 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17814 event pairs, 513 based on Foata normal form. 5/3052 useless extension candidates. Maximal degree in co-relation 21180. Up to 2770 conditions per place. [2024-06-20 18:43:37,637 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 149 selfloop transitions, 21 changer transitions 0/189 dead transitions. [2024-06-20 18:43:37,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 189 transitions, 2047 flow [2024-06-20 18:43:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:43:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:43:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-20 18:43:37,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-20 18:43:37,639 INFO L175 Difference]: Start difference. First operand has 153 places, 169 transitions, 1621 flow. Second operand 8 states and 145 transitions. [2024-06-20 18:43:37,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 189 transitions, 2047 flow [2024-06-20 18:43:37,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 189 transitions, 1981 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-20 18:43:37,732 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 1653 flow [2024-06-20 18:43:37,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1653, PETRI_PLACES=158, PETRI_TRANSITIONS=172} [2024-06-20 18:43:37,733 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 116 predicate places. [2024-06-20 18:43:37,733 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 1653 flow [2024-06-20 18:43:37,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:37,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:43:37,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:43:37,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 18:43:37,734 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:43:37,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:43:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1571105318, now seen corresponding path program 3 times [2024-06-20 18:43:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:43:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655199067] [2024-06-20 18:43:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:43:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:43:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:43:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:43:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:43:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655199067] [2024-06-20 18:43:48,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655199067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:43:48,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:43:48,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:43:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833354276] [2024-06-20 18:43:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:43:48,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:43:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:43:48,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:43:48,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:43:48,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:43:48,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 172 transitions, 1653 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:48,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:43:48,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:43:48,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:43:49,578 INFO L124 PetriNetUnfolderBase]: 1984/3236 cut-off events. [2024-06-20 18:43:49,579 INFO L125 PetriNetUnfolderBase]: For 121945/121945 co-relation queries the response was YES. [2024-06-20 18:43:49,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22417 conditions, 3236 events. 1984/3236 cut-off events. For 121945/121945 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18458 event pairs, 534 based on Foata normal form. 2/3237 useless extension candidates. Maximal degree in co-relation 22349. Up to 3025 conditions per place. [2024-06-20 18:43:49,604 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 176 selfloop transitions, 20 changer transitions 0/201 dead transitions. [2024-06-20 18:43:49,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 201 transitions, 2140 flow [2024-06-20 18:43:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:43:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:43:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-20 18:43:49,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:43:49,605 INFO L175 Difference]: Start difference. First operand has 158 places, 172 transitions, 1653 flow. Second operand 9 states and 162 transitions. [2024-06-20 18:43:49,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 201 transitions, 2140 flow [2024-06-20 18:43:49,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 201 transitions, 2036 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-20 18:43:49,727 INFO L231 Difference]: Finished difference. Result has 161 places, 173 transitions, 1608 flow [2024-06-20 18:43:49,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1608, PETRI_PLACES=161, PETRI_TRANSITIONS=173} [2024-06-20 18:43:49,727 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 119 predicate places. [2024-06-20 18:43:49,728 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 173 transitions, 1608 flow [2024-06-20 18:43:49,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:43:49,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:43:49,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:43:49,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 18:43:49,728 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:43:49,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:43:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1715626104, now seen corresponding path program 4 times [2024-06-20 18:43:49,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:43:49,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76204685] [2024-06-20 18:43:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:43:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:43:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:43:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:43:59,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:43:59,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76204685] [2024-06-20 18:43:59,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76204685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:43:59,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:43:59,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:43:59,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511835303] [2024-06-20 18:43:59,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:43:59,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:43:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:43:59,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:43:59,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:44:00,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:44:00,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 173 transitions, 1608 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:00,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:44:00,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:44:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:44:01,154 INFO L124 PetriNetUnfolderBase]: 1994/3252 cut-off events. [2024-06-20 18:44:01,154 INFO L125 PetriNetUnfolderBase]: For 127416/127420 co-relation queries the response was YES. [2024-06-20 18:44:01,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22601 conditions, 3252 events. 1994/3252 cut-off events. For 127416/127420 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18575 event pairs, 541 based on Foata normal form. 6/3257 useless extension candidates. Maximal degree in co-relation 22532. Up to 3019 conditions per place. [2024-06-20 18:44:01,178 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 159 selfloop transitions, 27 changer transitions 0/191 dead transitions. [2024-06-20 18:44:01,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 191 transitions, 2102 flow [2024-06-20 18:44:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:44:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:44:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 18:44:01,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:44:01,180 INFO L175 Difference]: Start difference. First operand has 161 places, 173 transitions, 1608 flow. Second operand 7 states and 126 transitions. [2024-06-20 18:44:01,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 191 transitions, 2102 flow [2024-06-20 18:44:01,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 191 transitions, 2036 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-20 18:44:01,285 INFO L231 Difference]: Finished difference. Result has 159 places, 176 transitions, 1666 flow [2024-06-20 18:44:01,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1666, PETRI_PLACES=159, PETRI_TRANSITIONS=176} [2024-06-20 18:44:01,285 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-20 18:44:01,285 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 176 transitions, 1666 flow [2024-06-20 18:44:01,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:01,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:44:01,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:44:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 18:44:01,286 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:44:01,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:44:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash 696345834, now seen corresponding path program 5 times [2024-06-20 18:44:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:44:01,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104526359] [2024-06-20 18:44:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:44:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:44:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:44:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:44:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:44:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104526359] [2024-06-20 18:44:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104526359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:44:12,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:44:12,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:44:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640420108] [2024-06-20 18:44:12,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:44:12,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:44:12,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:44:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:44:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:44:12,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:44:12,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 176 transitions, 1666 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:12,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:44:12,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:44:12,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:44:13,702 INFO L124 PetriNetUnfolderBase]: 2012/3278 cut-off events. [2024-06-20 18:44:13,702 INFO L125 PetriNetUnfolderBase]: For 135791/135793 co-relation queries the response was YES. [2024-06-20 18:44:13,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23330 conditions, 3278 events. 2012/3278 cut-off events. For 135791/135793 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18736 event pairs, 539 based on Foata normal form. 4/3281 useless extension candidates. Maximal degree in co-relation 23260. Up to 3006 conditions per place. [2024-06-20 18:44:13,724 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 155 selfloop transitions, 46 changer transitions 0/206 dead transitions. [2024-06-20 18:44:13,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 206 transitions, 2395 flow [2024-06-20 18:44:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:44:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:44:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-20 18:44:13,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-20 18:44:13,726 INFO L175 Difference]: Start difference. First operand has 159 places, 176 transitions, 1666 flow. Second operand 8 states and 147 transitions. [2024-06-20 18:44:13,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 206 transitions, 2395 flow [2024-06-20 18:44:13,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 206 transitions, 2299 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-20 18:44:13,837 INFO L231 Difference]: Finished difference. Result has 163 places, 185 transitions, 1857 flow [2024-06-20 18:44:13,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1570, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1857, PETRI_PLACES=163, PETRI_TRANSITIONS=185} [2024-06-20 18:44:13,837 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places. [2024-06-20 18:44:13,837 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 185 transitions, 1857 flow [2024-06-20 18:44:13,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:13,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:44:13,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:44:13,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 18:44:13,838 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:44:13,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:44:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash 988579650, now seen corresponding path program 6 times [2024-06-20 18:44:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:44:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145948495] [2024-06-20 18:44:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:44:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:44:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:44:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:44:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:44:24,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145948495] [2024-06-20 18:44:24,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145948495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:44:24,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:44:24,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:44:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025010941] [2024-06-20 18:44:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:44:24,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:44:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:44:24,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:44:24,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:44:24,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:44:24,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 185 transitions, 1857 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:24,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:44:24,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:44:24,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:44:25,641 INFO L124 PetriNetUnfolderBase]: 2006/3272 cut-off events. [2024-06-20 18:44:25,642 INFO L125 PetriNetUnfolderBase]: For 142461/142467 co-relation queries the response was YES. [2024-06-20 18:44:25,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23687 conditions, 3272 events. 2006/3272 cut-off events. For 142461/142467 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18707 event pairs, 551 based on Foata normal form. 8/3279 useless extension candidates. Maximal degree in co-relation 23615. Up to 3001 conditions per place. [2024-06-20 18:44:25,664 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 149 selfloop transitions, 44 changer transitions 0/198 dead transitions. [2024-06-20 18:44:25,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 198 transitions, 2315 flow [2024-06-20 18:44:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:44:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:44:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 18:44:25,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:44:25,665 INFO L175 Difference]: Start difference. First operand has 163 places, 185 transitions, 1857 flow. Second operand 7 states and 126 transitions. [2024-06-20 18:44:25,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 198 transitions, 2315 flow [2024-06-20 18:44:25,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 198 transitions, 2189 flow, removed 54 selfloop flow, removed 3 redundant places. [2024-06-20 18:44:25,777 INFO L231 Difference]: Finished difference. Result has 167 places, 185 transitions, 1825 flow [2024-06-20 18:44:25,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1825, PETRI_PLACES=167, PETRI_TRANSITIONS=185} [2024-06-20 18:44:25,777 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-06-20 18:44:25,777 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 185 transitions, 1825 flow [2024-06-20 18:44:25,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:25,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:44:25,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:44:25,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 18:44:25,778 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:44:25,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:44:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1001920066, now seen corresponding path program 2 times [2024-06-20 18:44:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:44:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085869287] [2024-06-20 18:44:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:44:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:44:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:44:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:44:38,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:44:38,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085869287] [2024-06-20 18:44:38,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085869287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:44:38,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:44:38,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:44:38,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161732181] [2024-06-20 18:44:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:44:38,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:44:38,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:44:38,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:44:38,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:44:38,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:44:38,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 185 transitions, 1825 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:38,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:44:38,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:44:38,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:44:39,978 INFO L124 PetriNetUnfolderBase]: 1866/3102 cut-off events. [2024-06-20 18:44:39,978 INFO L125 PetriNetUnfolderBase]: For 143258/143268 co-relation queries the response was YES. [2024-06-20 18:44:39,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22598 conditions, 3102 events. 1866/3102 cut-off events. For 143258/143268 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 18140 event pairs, 516 based on Foata normal form. 2/3081 useless extension candidates. Maximal degree in co-relation 22524. Up to 2812 conditions per place. [2024-06-20 18:44:40,000 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 158 selfloop transitions, 17 changer transitions 0/199 dead transitions. [2024-06-20 18:44:40,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 199 transitions, 2251 flow [2024-06-20 18:44:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:44:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:44:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-20 18:44:40,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-20 18:44:40,001 INFO L175 Difference]: Start difference. First operand has 167 places, 185 transitions, 1825 flow. Second operand 8 states and 139 transitions. [2024-06-20 18:44:40,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 199 transitions, 2251 flow [2024-06-20 18:44:40,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 199 transitions, 2133 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 18:44:40,105 INFO L231 Difference]: Finished difference. Result has 169 places, 188 transitions, 1803 flow [2024-06-20 18:44:40,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1803, PETRI_PLACES=169, PETRI_TRANSITIONS=188} [2024-06-20 18:44:40,106 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places. [2024-06-20 18:44:40,106 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 188 transitions, 1803 flow [2024-06-20 18:44:40,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:40,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:44:40,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:44:40,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 18:44:40,106 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:44:40,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:44:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1522030298, now seen corresponding path program 3 times [2024-06-20 18:44:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:44:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267482719] [2024-06-20 18:44:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:44:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:44:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:44:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:44:52,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:44:52,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267482719] [2024-06-20 18:44:52,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267482719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:44:52,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:44:52,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:44:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194036215] [2024-06-20 18:44:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:44:52,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:44:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:44:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:44:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:44:53,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:44:53,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 188 transitions, 1803 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:53,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:44:53,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:44:53,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:44:54,149 INFO L124 PetriNetUnfolderBase]: 1880/3108 cut-off events. [2024-06-20 18:44:54,150 INFO L125 PetriNetUnfolderBase]: For 151586/151612 co-relation queries the response was YES. [2024-06-20 18:44:54,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22970 conditions, 3108 events. 1880/3108 cut-off events. For 151586/151612 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18130 event pairs, 523 based on Foata normal form. 6/3089 useless extension candidates. Maximal degree in co-relation 22896. Up to 2804 conditions per place. [2024-06-20 18:44:54,172 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 151 selfloop transitions, 28 changer transitions 0/203 dead transitions. [2024-06-20 18:44:54,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 203 transitions, 2251 flow [2024-06-20 18:44:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:44:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:44:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-20 18:44:54,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-20 18:44:54,173 INFO L175 Difference]: Start difference. First operand has 169 places, 188 transitions, 1803 flow. Second operand 8 states and 142 transitions. [2024-06-20 18:44:54,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 203 transitions, 2251 flow [2024-06-20 18:44:54,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 203 transitions, 2177 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-20 18:44:54,282 INFO L231 Difference]: Finished difference. Result has 171 places, 191 transitions, 1851 flow [2024-06-20 18:44:54,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1729, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1851, PETRI_PLACES=171, PETRI_TRANSITIONS=191} [2024-06-20 18:44:54,283 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-20 18:44:54,283 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 191 transitions, 1851 flow [2024-06-20 18:44:54,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:44:54,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:44:54,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:44:54,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 18:44:54,284 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:44:54,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:44:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1001474596, now seen corresponding path program 4 times [2024-06-20 18:44:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:44:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417847845] [2024-06-20 18:44:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:44:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:44:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:45:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:45:07,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:45:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417847845] [2024-06-20 18:45:07,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417847845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:45:07,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:45:07,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:45:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706189967] [2024-06-20 18:45:07,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:45:07,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:45:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:45:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:45:07,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:45:07,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:45:07,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 191 transitions, 1851 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:45:07,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:45:07,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:45:07,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:45:08,302 INFO L124 PetriNetUnfolderBase]: 1880/3115 cut-off events. [2024-06-20 18:45:08,302 INFO L125 PetriNetUnfolderBase]: For 161367/161391 co-relation queries the response was YES. [2024-06-20 18:45:08,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23485 conditions, 3115 events. 1880/3115 cut-off events. For 161367/161391 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 18287 event pairs, 521 based on Foata normal form. 8/3099 useless extension candidates. Maximal degree in co-relation 23410. Up to 2772 conditions per place. [2024-06-20 18:45:08,325 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 140 selfloop transitions, 51 changer transitions 0/215 dead transitions. [2024-06-20 18:45:08,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 215 transitions, 2639 flow [2024-06-20 18:45:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:45:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:45:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 18:45:08,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 18:45:08,327 INFO L175 Difference]: Start difference. First operand has 171 places, 191 transitions, 1851 flow. Second operand 8 states and 149 transitions. [2024-06-20 18:45:08,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 215 transitions, 2639 flow [2024-06-20 18:45:08,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 215 transitions, 2549 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-20 18:45:08,442 INFO L231 Difference]: Finished difference. Result has 173 places, 200 transitions, 2055 flow [2024-06-20 18:45:08,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2055, PETRI_PLACES=173, PETRI_TRANSITIONS=200} [2024-06-20 18:45:08,442 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places. [2024-06-20 18:45:08,442 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 200 transitions, 2055 flow [2024-06-20 18:45:08,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:45:08,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:45:08,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:45:08,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 18:45:08,443 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:45:08,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:45:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash 794855721, now seen corresponding path program 1 times [2024-06-20 18:45:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:45:08,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051572585] [2024-06-20 18:45:08,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:45:08,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:45:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:45:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:45:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:45:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051572585] [2024-06-20 18:45:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051572585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:45:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:45:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:45:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718049096] [2024-06-20 18:45:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:45:22,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:45:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:45:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:45:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:45:22,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:45:22,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 200 transitions, 2055 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:45:22,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:45:22,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:45:22,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:45:23,384 INFO L124 PetriNetUnfolderBase]: 1953/3242 cut-off events. [2024-06-20 18:45:23,384 INFO L125 PetriNetUnfolderBase]: For 168837/168841 co-relation queries the response was YES. [2024-06-20 18:45:23,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24577 conditions, 3242 events. 1953/3242 cut-off events. For 168837/168841 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19031 event pairs, 513 based on Foata normal form. 7/3239 useless extension candidates. Maximal degree in co-relation 24501. Up to 2961 conditions per place. [2024-06-20 18:45:23,414 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 194 selfloop transitions, 17 changer transitions 0/221 dead transitions. [2024-06-20 18:45:23,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 221 transitions, 2595 flow [2024-06-20 18:45:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:45:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:45:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-20 18:45:23,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-06-20 18:45:23,415 INFO L175 Difference]: Start difference. First operand has 173 places, 200 transitions, 2055 flow. Second operand 8 states and 146 transitions. [2024-06-20 18:45:23,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 221 transitions, 2595 flow [2024-06-20 18:45:23,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 221 transitions, 2522 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-20 18:45:23,557 INFO L231 Difference]: Finished difference. Result has 178 places, 203 transitions, 2094 flow [2024-06-20 18:45:23,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1982, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2094, PETRI_PLACES=178, PETRI_TRANSITIONS=203} [2024-06-20 18:45:23,558 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2024-06-20 18:45:23,558 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 203 transitions, 2094 flow [2024-06-20 18:45:23,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:45:23,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:45:23,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:45:23,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 18:45:23,558 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:45:23,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:45:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash -170239787, now seen corresponding path program 2 times [2024-06-20 18:45:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:45:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411062663] [2024-06-20 18:45:23,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:45:23,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:45:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:45:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:45:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:45:40,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411062663] [2024-06-20 18:45:40,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411062663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:45:40,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:45:40,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:45:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437913130] [2024-06-20 18:45:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:45:40,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:45:40,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:45:40,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:45:40,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:45:40,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:45:40,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 203 transitions, 2094 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:45:40,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:45:40,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:45:40,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:45:41,571 INFO L124 PetriNetUnfolderBase]: 1971/3273 cut-off events. [2024-06-20 18:45:41,571 INFO L125 PetriNetUnfolderBase]: For 176837/176841 co-relation queries the response was YES. [2024-06-20 18:45:41,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25251 conditions, 3273 events. 1971/3273 cut-off events. For 176837/176841 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19252 event pairs, 511 based on Foata normal form. 6/3269 useless extension candidates. Maximal degree in co-relation 25173. Up to 2976 conditions per place. [2024-06-20 18:45:41,596 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 192 selfloop transitions, 25 changer transitions 0/227 dead transitions. [2024-06-20 18:45:41,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 227 transitions, 2833 flow [2024-06-20 18:45:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:45:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:45:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-20 18:45:41,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-20 18:45:41,597 INFO L175 Difference]: Start difference. First operand has 178 places, 203 transitions, 2094 flow. Second operand 8 states and 147 transitions. [2024-06-20 18:45:41,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 227 transitions, 2833 flow [2024-06-20 18:45:41,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 227 transitions, 2747 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-20 18:45:41,739 INFO L231 Difference]: Finished difference. Result has 180 places, 210 transitions, 2228 flow [2024-06-20 18:45:41,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2228, PETRI_PLACES=180, PETRI_TRANSITIONS=210} [2024-06-20 18:45:41,740 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places. [2024-06-20 18:45:41,740 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 210 transitions, 2228 flow [2024-06-20 18:45:41,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:45:41,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:45:41,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:45:41,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 18:45:41,741 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:45:41,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:45:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash 994307241, now seen corresponding path program 3 times [2024-06-20 18:45:41,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:45:41,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194334187] [2024-06-20 18:45:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:45:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:45:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:45:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:45:57,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:45:57,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194334187] [2024-06-20 18:45:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194334187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:45:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:45:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:45:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014396387] [2024-06-20 18:45:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:45:57,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:45:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:45:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:45:57,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:45:58,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:45:58,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 210 transitions, 2228 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:45:58,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:45:58,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:45:58,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:45:59,276 INFO L124 PetriNetUnfolderBase]: 1989/3307 cut-off events. [2024-06-20 18:45:59,276 INFO L125 PetriNetUnfolderBase]: For 186982/186988 co-relation queries the response was YES. [2024-06-20 18:45:59,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26033 conditions, 3307 events. 1989/3307 cut-off events. For 186982/186988 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19572 event pairs, 513 based on Foata normal form. 8/3305 useless extension candidates. Maximal degree in co-relation 25954. Up to 2992 conditions per place. [2024-06-20 18:45:59,304 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 192 selfloop transitions, 30 changer transitions 0/232 dead transitions. [2024-06-20 18:45:59,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 232 transitions, 3001 flow [2024-06-20 18:45:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:45:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:45:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-20 18:45:59,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-20 18:45:59,306 INFO L175 Difference]: Start difference. First operand has 180 places, 210 transitions, 2228 flow. Second operand 8 states and 147 transitions. [2024-06-20 18:45:59,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 232 transitions, 3001 flow [2024-06-20 18:45:59,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 232 transitions, 2905 flow, removed 41 selfloop flow, removed 4 redundant places. [2024-06-20 18:45:59,496 INFO L231 Difference]: Finished difference. Result has 184 places, 217 transitions, 2376 flow [2024-06-20 18:45:59,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2376, PETRI_PLACES=184, PETRI_TRANSITIONS=217} [2024-06-20 18:45:59,497 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places. [2024-06-20 18:45:59,497 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 217 transitions, 2376 flow [2024-06-20 18:45:59,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:45:59,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:45:59,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:45:59,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 18:45:59,498 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:45:59,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:45:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1508958993, now seen corresponding path program 4 times [2024-06-20 18:45:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:45:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166135072] [2024-06-20 18:45:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:45:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:45:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:46:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:46:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:46:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166135072] [2024-06-20 18:46:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166135072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:46:15,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:46:15,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:46:15,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225460102] [2024-06-20 18:46:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:46:15,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:46:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:46:15,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:46:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:46:15,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:46:15,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 217 transitions, 2376 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:46:15,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:46:15,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:46:15,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:46:16,864 INFO L124 PetriNetUnfolderBase]: 1992/3312 cut-off events. [2024-06-20 18:46:16,864 INFO L125 PetriNetUnfolderBase]: For 193758/193764 co-relation queries the response was YES. [2024-06-20 18:46:16,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26474 conditions, 3312 events. 1992/3312 cut-off events. For 193758/193764 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 19552 event pairs, 511 based on Foata normal form. 8/3311 useless extension candidates. Maximal degree in co-relation 26393. Up to 2947 conditions per place. [2024-06-20 18:46:16,889 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 175 selfloop transitions, 54 changer transitions 0/239 dead transitions. [2024-06-20 18:46:16,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 239 transitions, 3270 flow [2024-06-20 18:46:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:46:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:46:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-20 18:46:16,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-20 18:46:16,892 INFO L175 Difference]: Start difference. First operand has 184 places, 217 transitions, 2376 flow. Second operand 8 states and 150 transitions. [2024-06-20 18:46:16,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 239 transitions, 3270 flow [2024-06-20 18:46:17,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 239 transitions, 3154 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-20 18:46:17,067 INFO L231 Difference]: Finished difference. Result has 189 places, 225 transitions, 2594 flow [2024-06-20 18:46:17,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2594, PETRI_PLACES=189, PETRI_TRANSITIONS=225} [2024-06-20 18:46:17,067 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places. [2024-06-20 18:46:17,067 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 225 transitions, 2594 flow [2024-06-20 18:46:17,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:46:17,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:46:17,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:46:17,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 18:46:17,068 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:46:17,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:46:17,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1001935938, now seen corresponding path program 1 times [2024-06-20 18:46:17,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:46:17,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256927836] [2024-06-20 18:46:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:46:17,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:46:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:46:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:46:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:46:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256927836] [2024-06-20 18:46:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256927836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:46:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:46:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:46:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058761460] [2024-06-20 18:46:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:46:29,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:46:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:46:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:46:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:46:30,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:46:30,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 225 transitions, 2594 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:46:30,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:46:30,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:46:30,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:46:31,326 INFO L124 PetriNetUnfolderBase]: 1938/3224 cut-off events. [2024-06-20 18:46:31,327 INFO L125 PetriNetUnfolderBase]: For 200610/200636 co-relation queries the response was YES. [2024-06-20 18:46:31,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26636 conditions, 3224 events. 1938/3224 cut-off events. For 200610/200636 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18956 event pairs, 516 based on Foata normal form. 6/3207 useless extension candidates. Maximal degree in co-relation 26552. Up to 2918 conditions per place. [2024-06-20 18:46:31,355 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 197 selfloop transitions, 19 changer transitions 0/240 dead transitions. [2024-06-20 18:46:31,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 240 transitions, 3120 flow [2024-06-20 18:46:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:46:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:46:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-20 18:46:31,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173441734417344 [2024-06-20 18:46:31,356 INFO L175 Difference]: Start difference. First operand has 189 places, 225 transitions, 2594 flow. Second operand 9 states and 154 transitions. [2024-06-20 18:46:31,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 240 transitions, 3120 flow [2024-06-20 18:46:31,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 240 transitions, 2894 flow, removed 68 selfloop flow, removed 6 redundant places. [2024-06-20 18:46:31,551 INFO L231 Difference]: Finished difference. Result has 192 places, 227 transitions, 2479 flow [2024-06-20 18:46:31,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2372, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2479, PETRI_PLACES=192, PETRI_TRANSITIONS=227} [2024-06-20 18:46:31,551 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2024-06-20 18:46:31,552 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 227 transitions, 2479 flow [2024-06-20 18:46:31,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:46:31,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:46:31,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:46:31,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 18:46:31,552 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:46:31,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:46:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1961680798, now seen corresponding path program 1 times [2024-06-20 18:46:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:46:31,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135599478] [2024-06-20 18:46:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:46:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:46:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:46:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:46:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:46:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135599478] [2024-06-20 18:46:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135599478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:46:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:46:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:46:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016165626] [2024-06-20 18:46:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:46:42,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:46:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:46:42,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:46:42,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:46:42,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:46:42,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 227 transitions, 2479 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:46:42,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:46:42,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:46:42,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:46:43,900 INFO L124 PetriNetUnfolderBase]: 2123/3454 cut-off events. [2024-06-20 18:46:43,900 INFO L125 PetriNetUnfolderBase]: For 201154/201154 co-relation queries the response was YES. [2024-06-20 18:46:43,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27292 conditions, 3454 events. 2123/3454 cut-off events. For 201154/201154 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19886 event pairs, 545 based on Foata normal form. 2/3455 useless extension candidates. Maximal degree in co-relation 27208. Up to 3208 conditions per place. [2024-06-20 18:46:43,927 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 223 selfloop transitions, 22 changer transitions 0/250 dead transitions. [2024-06-20 18:46:43,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 250 transitions, 3111 flow [2024-06-20 18:46:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:46:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:46:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-20 18:46:43,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564459930313589 [2024-06-20 18:46:43,928 INFO L175 Difference]: Start difference. First operand has 192 places, 227 transitions, 2479 flow. Second operand 7 states and 131 transitions. [2024-06-20 18:46:43,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 250 transitions, 3111 flow [2024-06-20 18:46:44,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 250 transitions, 3020 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-20 18:46:44,096 INFO L231 Difference]: Finished difference. Result has 192 places, 230 transitions, 2524 flow [2024-06-20 18:46:44,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2524, PETRI_PLACES=192, PETRI_TRANSITIONS=230} [2024-06-20 18:46:44,097 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2024-06-20 18:46:44,097 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 230 transitions, 2524 flow [2024-06-20 18:46:44,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:46:44,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:46:44,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:46:44,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 18:46:44,097 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:46:44,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:46:44,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1756116098, now seen corresponding path program 2 times [2024-06-20 18:46:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:46:44,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120236176] [2024-06-20 18:46:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:46:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:46:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:46:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:46:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:46:55,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120236176] [2024-06-20 18:46:55,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120236176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:46:55,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:46:55,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:46:55,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262161176] [2024-06-20 18:46:55,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:46:55,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:46:55,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:46:55,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:46:55,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:46:55,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:46:55,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 230 transitions, 2524 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:46:55,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:46:55,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:46:55,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:46:56,675 INFO L124 PetriNetUnfolderBase]: 2138/3479 cut-off events. [2024-06-20 18:46:56,675 INFO L125 PetriNetUnfolderBase]: For 210866/210866 co-relation queries the response was YES. [2024-06-20 18:46:56,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27949 conditions, 3479 events. 2138/3479 cut-off events. For 210866/210866 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20117 event pairs, 545 based on Foata normal form. 2/3480 useless extension candidates. Maximal degree in co-relation 27864. Up to 3235 conditions per place. [2024-06-20 18:46:56,705 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 237 selfloop transitions, 23 changer transitions 0/265 dead transitions. [2024-06-20 18:46:56,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 265 transitions, 3253 flow [2024-06-20 18:46:56,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:46:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:46:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-20 18:46:56,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-20 18:46:56,706 INFO L175 Difference]: Start difference. First operand has 192 places, 230 transitions, 2524 flow. Second operand 9 states and 164 transitions. [2024-06-20 18:46:56,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 265 transitions, 3253 flow [2024-06-20 18:46:56,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 265 transitions, 3155 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-20 18:46:56,931 INFO L231 Difference]: Finished difference. Result has 197 places, 236 transitions, 2603 flow [2024-06-20 18:46:56,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2603, PETRI_PLACES=197, PETRI_TRANSITIONS=236} [2024-06-20 18:46:56,931 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places. [2024-06-20 18:46:56,931 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 236 transitions, 2603 flow [2024-06-20 18:46:56,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:46:56,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:46:56,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:46:56,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 18:46:56,932 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:46:56,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:46:56,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1491485688, now seen corresponding path program 1 times [2024-06-20 18:46:56,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:46:56,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142479897] [2024-06-20 18:46:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:46:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:46:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:47:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:47:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:47:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142479897] [2024-06-20 18:47:08,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142479897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:47:08,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:47:08,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:47:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171102473] [2024-06-20 18:47:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:47:08,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:47:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:47:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:47:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:47:08,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:47:08,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 236 transitions, 2603 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:47:08,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:47:08,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:47:08,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:47:09,915 INFO L124 PetriNetUnfolderBase]: 2146/3476 cut-off events. [2024-06-20 18:47:09,916 INFO L125 PetriNetUnfolderBase]: For 221645/221645 co-relation queries the response was YES. [2024-06-20 18:47:09,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28513 conditions, 3476 events. 2146/3476 cut-off events. For 221645/221645 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 19929 event pairs, 434 based on Foata normal form. 2/3477 useless extension candidates. Maximal degree in co-relation 28426. Up to 3233 conditions per place. [2024-06-20 18:47:09,945 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 246 selfloop transitions, 15 changer transitions 0/266 dead transitions. [2024-06-20 18:47:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 266 transitions, 3251 flow [2024-06-20 18:47:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:47:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:47:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-20 18:47:09,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-20 18:47:09,947 INFO L175 Difference]: Start difference. First operand has 197 places, 236 transitions, 2603 flow. Second operand 8 states and 147 transitions. [2024-06-20 18:47:09,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 266 transitions, 3251 flow [2024-06-20 18:47:10,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 266 transitions, 3119 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-06-20 18:47:10,160 INFO L231 Difference]: Finished difference. Result has 198 places, 238 transitions, 2566 flow [2024-06-20 18:47:10,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2471, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2566, PETRI_PLACES=198, PETRI_TRANSITIONS=238} [2024-06-20 18:47:10,161 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2024-06-20 18:47:10,161 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 238 transitions, 2566 flow [2024-06-20 18:47:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:47:10,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:47:10,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:47:10,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 18:47:10,162 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:47:10,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:47:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1958310292, now seen corresponding path program 2 times [2024-06-20 18:47:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:47:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693359832] [2024-06-20 18:47:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:47:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:47:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:47:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:47:21,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:47:21,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693359832] [2024-06-20 18:47:21,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693359832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:47:21,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:47:21,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:47:21,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867481957] [2024-06-20 18:47:21,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:47:21,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:47:21,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:47:21,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:47:21,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:47:21,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:47:21,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 238 transitions, 2566 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:47:21,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:47:21,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:47:21,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:47:22,613 INFO L124 PetriNetUnfolderBase]: 2154/3503 cut-off events. [2024-06-20 18:47:22,613 INFO L125 PetriNetUnfolderBase]: For 228373/228373 co-relation queries the response was YES. [2024-06-20 18:47:22,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28731 conditions, 3503 events. 2154/3503 cut-off events. For 228373/228373 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20263 event pairs, 543 based on Foata normal form. 2/3504 useless extension candidates. Maximal degree in co-relation 28644. Up to 3266 conditions per place. [2024-06-20 18:47:22,643 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 232 selfloop transitions, 20 changer transitions 0/257 dead transitions. [2024-06-20 18:47:22,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 257 transitions, 3172 flow [2024-06-20 18:47:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:47:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:47:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 18:47:22,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:47:22,644 INFO L175 Difference]: Start difference. First operand has 198 places, 238 transitions, 2566 flow. Second operand 7 states and 126 transitions. [2024-06-20 18:47:22,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 257 transitions, 3172 flow [2024-06-20 18:47:22,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 257 transitions, 3093 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-20 18:47:22,858 INFO L231 Difference]: Finished difference. Result has 199 places, 240 transitions, 2597 flow [2024-06-20 18:47:22,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2597, PETRI_PLACES=199, PETRI_TRANSITIONS=240} [2024-06-20 18:47:22,859 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 157 predicate places. [2024-06-20 18:47:22,859 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 240 transitions, 2597 flow [2024-06-20 18:47:22,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:47:22,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:47:22,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:47:22,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 18:47:22,860 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:47:22,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:47:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1074128382, now seen corresponding path program 3 times [2024-06-20 18:47:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:47:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804173790] [2024-06-20 18:47:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:47:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:47:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:47:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:47:33,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:47:33,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804173790] [2024-06-20 18:47:33,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804173790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:47:33,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:47:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:47:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278952376] [2024-06-20 18:47:33,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:47:33,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:47:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:47:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:47:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:47:33,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:47:33,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 240 transitions, 2597 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:47:33,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:47:33,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:47:33,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:47:35,113 INFO L124 PetriNetUnfolderBase]: 2164/3522 cut-off events. [2024-06-20 18:47:35,113 INFO L125 PetriNetUnfolderBase]: For 237051/237053 co-relation queries the response was YES. [2024-06-20 18:47:35,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29061 conditions, 3522 events. 2164/3522 cut-off events. For 237051/237053 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20398 event pairs, 547 based on Foata normal form. 4/3525 useless extension candidates. Maximal degree in co-relation 28973. Up to 3237 conditions per place. [2024-06-20 18:47:35,144 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 233 selfloop transitions, 29 changer transitions 0/267 dead transitions. [2024-06-20 18:47:35,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 267 transitions, 3289 flow [2024-06-20 18:47:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:47:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:47:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 18:47:35,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-20 18:47:35,146 INFO L175 Difference]: Start difference. First operand has 199 places, 240 transitions, 2597 flow. Second operand 8 states and 149 transitions. [2024-06-20 18:47:35,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 267 transitions, 3289 flow [2024-06-20 18:47:35,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 267 transitions, 3197 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-20 18:47:35,326 INFO L231 Difference]: Finished difference. Result has 202 places, 243 transitions, 2667 flow [2024-06-20 18:47:35,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2667, PETRI_PLACES=202, PETRI_TRANSITIONS=243} [2024-06-20 18:47:35,327 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-20 18:47:35,327 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 243 transitions, 2667 flow [2024-06-20 18:47:35,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:47:35,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:47:35,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:47:35,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 18:47:35,327 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:47:35,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:47:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1961830714, now seen corresponding path program 1 times [2024-06-20 18:47:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:47:35,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629832952] [2024-06-20 18:47:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:47:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:47:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:47:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:47:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:47:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629832952] [2024-06-20 18:47:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629832952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:47:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:47:46,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:47:46,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779409206] [2024-06-20 18:47:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:47:46,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:47:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:47:46,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:47:46,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:47:47,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:47:47,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 243 transitions, 2667 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:47:47,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:47:47,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:47:47,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:47:48,461 INFO L124 PetriNetUnfolderBase]: 2169/3528 cut-off events. [2024-06-20 18:47:48,462 INFO L125 PetriNetUnfolderBase]: For 246425/246425 co-relation queries the response was YES. [2024-06-20 18:47:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29611 conditions, 3528 events. 2169/3528 cut-off events. For 246425/246425 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20434 event pairs, 550 based on Foata normal form. 1/3527 useless extension candidates. Maximal degree in co-relation 29522. Up to 3253 conditions per place. [2024-06-20 18:47:48,493 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 235 selfloop transitions, 29 changer transitions 0/269 dead transitions. [2024-06-20 18:47:48,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 269 transitions, 3337 flow [2024-06-20 18:47:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:47:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:47:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-20 18:47:48,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-20 18:47:48,494 INFO L175 Difference]: Start difference. First operand has 202 places, 243 transitions, 2667 flow. Second operand 8 states and 148 transitions. [2024-06-20 18:47:48,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 269 transitions, 3337 flow [2024-06-20 18:47:48,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 269 transitions, 3207 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-20 18:47:48,715 INFO L231 Difference]: Finished difference. Result has 205 places, 246 transitions, 2691 flow [2024-06-20 18:47:48,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2691, PETRI_PLACES=205, PETRI_TRANSITIONS=246} [2024-06-20 18:47:48,716 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places. [2024-06-20 18:47:48,716 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 246 transitions, 2691 flow [2024-06-20 18:47:48,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:47:48,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:47:48,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:47:48,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 18:47:48,716 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:47:48,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:47:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1260040822, now seen corresponding path program 4 times [2024-06-20 18:47:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:47:48,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494449327] [2024-06-20 18:47:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:47:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:47:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:48:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:48:00,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:48:00,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494449327] [2024-06-20 18:48:00,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494449327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:48:00,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:48:00,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:48:00,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016527160] [2024-06-20 18:48:00,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:48:00,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:48:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:48:00,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:48:00,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:48:00,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:48:00,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 246 transitions, 2691 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:00,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:48:00,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:48:00,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:48:02,071 INFO L124 PetriNetUnfolderBase]: 2179/3545 cut-off events. [2024-06-20 18:48:02,071 INFO L125 PetriNetUnfolderBase]: For 257868/257870 co-relation queries the response was YES. [2024-06-20 18:48:02,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30137 conditions, 3545 events. 2179/3545 cut-off events. For 257868/257870 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20529 event pairs, 546 based on Foata normal form. 4/3548 useless extension candidates. Maximal degree in co-relation 30047. Up to 3238 conditions per place. [2024-06-20 18:48:02,105 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 229 selfloop transitions, 37 changer transitions 0/271 dead transitions. [2024-06-20 18:48:02,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 271 transitions, 3411 flow [2024-06-20 18:48:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:48:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:48:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-20 18:48:02,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-20 18:48:02,106 INFO L175 Difference]: Start difference. First operand has 205 places, 246 transitions, 2691 flow. Second operand 8 states and 148 transitions. [2024-06-20 18:48:02,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 271 transitions, 3411 flow [2024-06-20 18:48:02,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 271 transitions, 3279 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-20 18:48:02,385 INFO L231 Difference]: Finished difference. Result has 207 places, 249 transitions, 2747 flow [2024-06-20 18:48:02,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2559, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2747, PETRI_PLACES=207, PETRI_TRANSITIONS=249} [2024-06-20 18:48:02,386 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places. [2024-06-20 18:48:02,386 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 249 transitions, 2747 flow [2024-06-20 18:48:02,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:02,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:48:02,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:48:02,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 18:48:02,386 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:48:02,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:48:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1961835550, now seen corresponding path program 1 times [2024-06-20 18:48:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:48:02,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955514286] [2024-06-20 18:48:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:48:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:48:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:48:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:48:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:48:15,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955514286] [2024-06-20 18:48:15,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955514286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:48:15,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:48:15,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:48:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746015932] [2024-06-20 18:48:15,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:48:15,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:48:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:48:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:48:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:48:15,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:48:15,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 249 transitions, 2747 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:15,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:48:15,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:48:15,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:48:16,792 INFO L124 PetriNetUnfolderBase]: 2189/3559 cut-off events. [2024-06-20 18:48:16,792 INFO L125 PetriNetUnfolderBase]: For 271071/271073 co-relation queries the response was YES. [2024-06-20 18:48:16,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30733 conditions, 3559 events. 2189/3559 cut-off events. For 271071/271073 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20634 event pairs, 545 based on Foata normal form. 4/3562 useless extension candidates. Maximal degree in co-relation 30642. Up to 3308 conditions per place. [2024-06-20 18:48:16,820 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 246 selfloop transitions, 23 changer transitions 0/274 dead transitions. [2024-06-20 18:48:16,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 274 transitions, 3437 flow [2024-06-20 18:48:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:48:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:48:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-20 18:48:16,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-20 18:48:16,821 INFO L175 Difference]: Start difference. First operand has 207 places, 249 transitions, 2747 flow. Second operand 8 states and 145 transitions. [2024-06-20 18:48:16,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 274 transitions, 3437 flow [2024-06-20 18:48:17,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 274 transitions, 3277 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-06-20 18:48:17,082 INFO L231 Difference]: Finished difference. Result has 209 places, 253 transitions, 2732 flow [2024-06-20 18:48:17,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2587, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2732, PETRI_PLACES=209, PETRI_TRANSITIONS=253} [2024-06-20 18:48:17,083 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places. [2024-06-20 18:48:17,083 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 253 transitions, 2732 flow [2024-06-20 18:48:17,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:17,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:48:17,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:48:17,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 18:48:17,084 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:48:17,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:48:17,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1083029272, now seen corresponding path program 5 times [2024-06-20 18:48:17,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:48:17,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610043155] [2024-06-20 18:48:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:48:17,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:48:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:48:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:48:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:48:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610043155] [2024-06-20 18:48:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610043155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:48:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:48:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:48:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885478653] [2024-06-20 18:48:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:48:28,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:48:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:48:28,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:48:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:48:28,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:48:28,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 253 transitions, 2732 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:28,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:48:28,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:48:28,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:48:29,909 INFO L124 PetriNetUnfolderBase]: 2199/3576 cut-off events. [2024-06-20 18:48:29,909 INFO L125 PetriNetUnfolderBase]: For 281517/281517 co-relation queries the response was YES. [2024-06-20 18:48:29,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31375 conditions, 3576 events. 2199/3576 cut-off events. For 281517/281517 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 20743 event pairs, 543 based on Foata normal form. 2/3577 useless extension candidates. Maximal degree in co-relation 31283. Up to 3331 conditions per place. [2024-06-20 18:48:29,943 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 247 selfloop transitions, 22 changer transitions 0/274 dead transitions. [2024-06-20 18:48:29,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 274 transitions, 3442 flow [2024-06-20 18:48:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:48:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:48:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-20 18:48:29,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-20 18:48:29,945 INFO L175 Difference]: Start difference. First operand has 209 places, 253 transitions, 2732 flow. Second operand 8 states and 141 transitions. [2024-06-20 18:48:29,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 274 transitions, 3442 flow [2024-06-20 18:48:30,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 274 transitions, 3325 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-06-20 18:48:30,174 INFO L231 Difference]: Finished difference. Result has 211 places, 256 transitions, 2781 flow [2024-06-20 18:48:30,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2615, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2781, PETRI_PLACES=211, PETRI_TRANSITIONS=256} [2024-06-20 18:48:30,175 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 169 predicate places. [2024-06-20 18:48:30,175 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 256 transitions, 2781 flow [2024-06-20 18:48:30,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:30,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:48:30,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:48:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 18:48:30,176 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:48:30,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:48:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1082909302, now seen corresponding path program 6 times [2024-06-20 18:48:30,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:48:30,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731992791] [2024-06-20 18:48:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:48:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:48:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:48:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:48:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:48:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731992791] [2024-06-20 18:48:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731992791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:48:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:48:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:48:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781201093] [2024-06-20 18:48:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:48:41,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:48:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:48:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:48:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:48:41,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:48:41,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 256 transitions, 2781 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:41,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:48:41,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:48:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:48:42,838 INFO L124 PetriNetUnfolderBase]: 2225/3619 cut-off events. [2024-06-20 18:48:42,838 INFO L125 PetriNetUnfolderBase]: For 300400/300402 co-relation queries the response was YES. [2024-06-20 18:48:42,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32466 conditions, 3619 events. 2225/3619 cut-off events. For 300400/300402 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 21070 event pairs, 548 based on Foata normal form. 4/3622 useless extension candidates. Maximal degree in co-relation 32373. Up to 3248 conditions per place. [2024-06-20 18:48:42,869 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 219 selfloop transitions, 59 changer transitions 0/283 dead transitions. [2024-06-20 18:48:42,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 283 transitions, 3791 flow [2024-06-20 18:48:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:48:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:48:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-20 18:48:42,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-20 18:48:42,872 INFO L175 Difference]: Start difference. First operand has 211 places, 256 transitions, 2781 flow. Second operand 8 states and 148 transitions. [2024-06-20 18:48:42,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 283 transitions, 3791 flow [2024-06-20 18:48:43,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 283 transitions, 3623 flow, removed 55 selfloop flow, removed 7 redundant places. [2024-06-20 18:48:43,185 INFO L231 Difference]: Finished difference. Result has 212 places, 262 transitions, 2975 flow [2024-06-20 18:48:43,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2613, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2975, PETRI_PLACES=212, PETRI_TRANSITIONS=262} [2024-06-20 18:48:43,185 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places. [2024-06-20 18:48:43,185 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 262 transitions, 2975 flow [2024-06-20 18:48:43,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:43,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:48:43,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:48:43,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 18:48:43,186 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:48:43,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:48:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1082671780, now seen corresponding path program 2 times [2024-06-20 18:48:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:48:43,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746542616] [2024-06-20 18:48:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:48:43,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:48:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:48:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:48:55,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:48:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746542616] [2024-06-20 18:48:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746542616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:48:55,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:48:55,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:48:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959073698] [2024-06-20 18:48:55,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:48:55,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:48:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:48:55,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:48:55,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:48:55,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:48:55,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 262 transitions, 2975 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:55,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:48:55,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:48:55,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:48:57,163 INFO L124 PetriNetUnfolderBase]: 2246/3648 cut-off events. [2024-06-20 18:48:57,163 INFO L125 PetriNetUnfolderBase]: For 315921/315923 co-relation queries the response was YES. [2024-06-20 18:48:57,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33295 conditions, 3648 events. 2246/3648 cut-off events. For 315921/315923 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 21208 event pairs, 546 based on Foata normal form. 3/3650 useless extension candidates. Maximal degree in co-relation 33203. Up to 3354 conditions per place. [2024-06-20 18:48:57,195 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 246 selfloop transitions, 39 changer transitions 0/290 dead transitions. [2024-06-20 18:48:57,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 290 transitions, 3887 flow [2024-06-20 18:48:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:48:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:48:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-20 18:48:57,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420731707317073 [2024-06-20 18:48:57,196 INFO L175 Difference]: Start difference. First operand has 212 places, 262 transitions, 2975 flow. Second operand 8 states and 145 transitions. [2024-06-20 18:48:57,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 290 transitions, 3887 flow [2024-06-20 18:48:57,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 290 transitions, 3739 flow, removed 55 selfloop flow, removed 4 redundant places. [2024-06-20 18:48:57,508 INFO L231 Difference]: Finished difference. Result has 217 places, 271 transitions, 3097 flow [2024-06-20 18:48:57,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2827, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3097, PETRI_PLACES=217, PETRI_TRANSITIONS=271} [2024-06-20 18:48:57,509 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places. [2024-06-20 18:48:57,509 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 271 transitions, 3097 flow [2024-06-20 18:48:57,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:48:57,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:48:57,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:48:57,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 18:48:57,509 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:48:57,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:48:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1082908930, now seen corresponding path program 3 times [2024-06-20 18:48:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:48:57,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359628894] [2024-06-20 18:48:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:48:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:48:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:49:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:49:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:49:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359628894] [2024-06-20 18:49:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359628894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:49:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:49:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:49:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434055256] [2024-06-20 18:49:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:49:09,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:49:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:49:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:49:09,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:49:09,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-20 18:49:09,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 271 transitions, 3097 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:49:09,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:49:09,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-20 18:49:09,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:49:11,312 INFO L124 PetriNetUnfolderBase]: 2256/3662 cut-off events. [2024-06-20 18:49:11,312 INFO L125 PetriNetUnfolderBase]: For 331189/331191 co-relation queries the response was YES. [2024-06-20 18:49:11,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34202 conditions, 3662 events. 2256/3662 cut-off events. For 331189/331191 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 21284 event pairs, 546 based on Foata normal form. 4/3665 useless extension candidates. Maximal degree in co-relation 34107. Up to 3386 conditions per place. [2024-06-20 18:49:11,346 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 258 selfloop transitions, 31 changer transitions 0/294 dead transitions. [2024-06-20 18:49:11,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 294 transitions, 3873 flow [2024-06-20 18:49:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:49:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:49:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-20 18:49:11,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-20 18:49:11,347 INFO L175 Difference]: Start difference. First operand has 217 places, 271 transitions, 3097 flow. Second operand 8 states and 144 transitions. [2024-06-20 18:49:11,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 294 transitions, 3873 flow [2024-06-20 18:49:11,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 294 transitions, 3743 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-20 18:49:11,666 INFO L231 Difference]: Finished difference. Result has 221 places, 275 transitions, 3152 flow [2024-06-20 18:49:11,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2995, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3152, PETRI_PLACES=221, PETRI_TRANSITIONS=275} [2024-06-20 18:49:11,667 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places. [2024-06-20 18:49:11,667 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 275 transitions, 3152 flow [2024-06-20 18:49:11,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:49:11,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:49:11,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:49:11,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 18:49:11,668 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:49:11,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:49:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1787313294, now seen corresponding path program 1 times [2024-06-20 18:49:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:49:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104031459] [2024-06-20 18:49:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:49:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:49:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:49:24,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-20 18:49:24,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:49:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104031459] [2024-06-20 18:49:24,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104031459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:49:24,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:49:24,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:49:24,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475613676] [2024-06-20 18:49:24,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:49:24,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:49:24,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:49:24,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:49:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:49:25,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-20 18:49:25,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 275 transitions, 3152 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:49:25,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:49:25,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-20 18:49:25,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:49:26,608 INFO L124 PetriNetUnfolderBase]: 2078/3434 cut-off events. [2024-06-20 18:49:26,608 INFO L125 PetriNetUnfolderBase]: For 331949/331981 co-relation queries the response was YES. [2024-06-20 18:49:26,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32712 conditions, 3434 events. 2078/3434 cut-off events. For 331949/331981 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 20367 event pairs, 510 based on Foata normal form. 8/3411 useless extension candidates. Maximal degree in co-relation 32615. Up to 3059 conditions per place. [2024-06-20 18:49:26,639 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 235 selfloop transitions, 29 changer transitions 0/293 dead transitions. [2024-06-20 18:49:26,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 293 transitions, 3724 flow [2024-06-20 18:49:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:49:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:49:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-20 18:49:26,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43360433604336046 [2024-06-20 18:49:26,640 INFO L175 Difference]: Start difference. First operand has 221 places, 275 transitions, 3152 flow. Second operand 9 states and 160 transitions. [2024-06-20 18:49:26,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 293 transitions, 3724 flow [2024-06-20 18:49:26,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 293 transitions, 3583 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-20 18:49:26,908 INFO L231 Difference]: Finished difference. Result has 224 places, 275 transitions, 3075 flow [2024-06-20 18:49:26,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3011, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3075, PETRI_PLACES=224, PETRI_TRANSITIONS=275} [2024-06-20 18:49:26,909 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places. [2024-06-20 18:49:26,909 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 275 transitions, 3075 flow [2024-06-20 18:49:26,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:49:26,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:49:26,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:49:26,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 18:49:26,910 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:49:26,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:49:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1109370824, now seen corresponding path program 2 times [2024-06-20 18:49:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:49:26,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973181470] [2024-06-20 18:49:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:49:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:49:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15