./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033.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/mix033.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/mix033.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix033.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-bcb38a6-m [2024-06-04 17:12:39,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:12:39,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:12:39,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:12:39,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:12:39,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:12:39,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:12:39,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:12:39,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:12:39,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:12:39,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:12:39,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:12:39,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:12:39,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:12:39,819 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:12:39,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:12:39,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:12:39,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:12:39,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:12:39,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:12:39,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:12:39,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:12:39,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:12:39,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:12:39,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:12:39,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:12:39,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:12:39,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:12:39,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:12:39,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:12:39,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:12:39,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:12:39,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:12:39,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:12:39,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:12:39,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:12:39,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:12:39,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:12:39,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:12:39,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:12:39,825 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:12:39,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:12:39,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:12:39,826 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-04 17:12:39,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:12:40,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:12:40,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:12:40,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:12:40,018 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:12:40,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2024-06-04 17:12:41,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:12:41,234 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:12:41,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2024-06-04 17:12:41,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75de1b598/1c77cd4765544f4592a7e1948afbff87/FLAGb26999b66 [2024-06-04 17:12:41,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75de1b598/1c77cd4765544f4592a7e1948afbff87 [2024-06-04 17:12:41,265 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:12:41,266 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:12:41,266 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/mix033.opt.yml/witness.yml [2024-06-04 17:12:41,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:12:41,449 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:12:41,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:12:41,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:12:41,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:12:41,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:12:41" (1/2) ... [2024-06-04 17:12:41,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58049c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:12:41, skipping insertion in model container [2024-06-04 17:12:41,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:12:41" (1/2) ... [2024-06-04 17:12:41,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4dbc3908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:12:41, skipping insertion in model container [2024-06-04 17:12:41,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:12:41" (2/2) ... [2024-06-04 17:12:41,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58049c93 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:41, skipping insertion in model container [2024-06-04 17:12:41,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:12:41" (2/2) ... [2024-06-04 17:12:41,457 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:12:41,537 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:12:41,539 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$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) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-04 17:12:41,540 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$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) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-04 17:12:41,540 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$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) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-04 17:12:41,541 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:12:41,541 INFO L106 edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1; [2024-06-04 17:12:41,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:12:41,893 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:12:41,912 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:12:42,330 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:12:42,357 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:12:42,358 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42 WrapperNode [2024-06-04 17:12:42,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:12:42,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:12:42,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:12:42,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:12:42,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,630 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2024-06-04 17:12:42,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:12:42,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:12:42,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:12:42,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:12:42,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,715 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-04 17:12:42,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:12:42,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:12:42,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:12:42,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:12:42,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (1/1) ... [2024-06-04 17:12:42,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:12:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:12:42,814 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-04 17:12:42,834 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-04 17:12:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:12:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:12:42,848 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:12:42,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:12:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:12:42,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:12:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 17:12:42,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 17:12:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:12:42,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:12:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:12:42,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:12:42,851 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:12:42,978 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:12:42,980 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:12:44,312 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:12:44,314 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:12:44,644 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:12:44,644 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:12:44,645 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:12:44 BoogieIcfgContainer [2024-06-04 17:12:44,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:12:44,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:12:44,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:12:44,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:12:44,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:12:41" (1/4) ... [2024-06-04 17:12:44,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbbcf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:12:44, skipping insertion in model container [2024-06-04 17:12:44,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:12:41" (2/4) ... [2024-06-04 17:12:44,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbbcf0b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:12:44, skipping insertion in model container [2024-06-04 17:12:44,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:12:42" (3/4) ... [2024-06-04 17:12:44,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbbcf0b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:12:44, skipping insertion in model container [2024-06-04 17:12:44,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:12:44" (4/4) ... [2024-06-04 17:12:44,653 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2024-06-04 17:12:44,666 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:12:44,666 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 17:12:44,666 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:12:44,805 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:12:44,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 102 flow [2024-06-04 17:12:44,899 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2024-06-04 17:12:44,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:12:44,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:12:44,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 45 transitions, 102 flow [2024-06-04 17:12:44,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 81 flow [2024-06-04 17:12:44,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:12:44,923 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;@13e4a03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:12:44,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 17:12:44,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:12:44,933 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:12:44,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:12:44,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:44,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:12:44,934 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-04 17:12:44,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1462142692, now seen corresponding path program 1 times [2024-06-04 17:12:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044742723] [2024-06-04 17:12:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:12:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044742723] [2024-06-04 17:12:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044742723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:52,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:52,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:12:52,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409500546] [2024-06-04 17:12:52,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:52,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:12:52,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:52,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:12:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:12:52,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2024-06-04 17:12:52,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:52,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:52,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2024-06-04 17:12:52,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:53,747 INFO L124 PetriNetUnfolderBase]: 1359/2190 cut-off events. [2024-06-04 17:12:53,747 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-04 17:12:53,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 2190 events. 1359/2190 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11459 event pairs, 941 based on Foata normal form. 1/2096 useless extension candidates. Maximal degree in co-relation 4291. Up to 2029 conditions per place. [2024-06-04 17:12:53,762 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 34 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-06-04 17:12:53,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 183 flow [2024-06-04 17:12:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:12:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:12:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-04 17:12:53,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2024-06-04 17:12:53,772 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 83 transitions. [2024-06-04 17:12:53,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 183 flow [2024-06-04 17:12:53,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 17:12:53,776 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 108 flow [2024-06-04 17:12:53,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-04 17:12:53,780 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-06-04 17:12:53,780 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 108 flow [2024-06-04 17:12:53,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:53,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:53,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:53,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:12:53,781 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-04 17:12:53,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -664792325, now seen corresponding path program 1 times [2024-06-04 17:12:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:53,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667447727] [2024-06-04 17:12:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:12:59,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:59,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667447727] [2024-06-04 17:12:59,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667447727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:59,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:59,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:12:59,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877163194] [2024-06-04 17:12:59,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:59,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:12:59,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:59,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:12:59,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:12:59,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 17:12:59,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:59,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:59,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 17:12:59,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:00,875 INFO L124 PetriNetUnfolderBase]: 1560/2438 cut-off events. [2024-06-04 17:13:00,876 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2024-06-04 17:13:00,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5456 conditions, 2438 events. 1560/2438 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12543 event pairs, 930 based on Foata normal form. 3/2403 useless extension candidates. Maximal degree in co-relation 5441. Up to 2302 conditions per place. [2024-06-04 17:13:00,887 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 42 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-04 17:13:00,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 252 flow [2024-06-04 17:13:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:13:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:13:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-06-04 17:13:00,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-06-04 17:13:00,889 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 108 flow. Second operand 4 states and 104 transitions. [2024-06-04 17:13:00,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 252 flow [2024-06-04 17:13:00,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:13:00,890 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 144 flow [2024-06-04 17:13:00,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-04 17:13:00,891 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-06-04 17:13:00,891 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 144 flow [2024-06-04 17:13:00,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:00,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:00,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:00,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:13:00,892 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-04 17:13:00,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 866275369, now seen corresponding path program 1 times [2024-06-04 17:13:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512861317] [2024-06-04 17:13:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512861317] [2024-06-04 17:13:06,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512861317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:06,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:06,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:13:06,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362904933] [2024-06-04 17:13:06,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:06,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:13:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:06,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:13:06,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:13:06,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 17:13:06,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:06,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:06,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 17:13:06,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:07,321 INFO L124 PetriNetUnfolderBase]: 1568/2498 cut-off events. [2024-06-04 17:13:07,322 INFO L125 PetriNetUnfolderBase]: For 1343/1343 co-relation queries the response was YES. [2024-06-04 17:13:07,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6133 conditions, 2498 events. 1568/2498 cut-off events. For 1343/1343 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13164 event pairs, 669 based on Foata normal form. 5/2482 useless extension candidates. Maximal degree in co-relation 6116. Up to 2248 conditions per place. [2024-06-04 17:13:07,334 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 55 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-04 17:13:07,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 406 flow [2024-06-04 17:13:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:13:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:13:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-06-04 17:13:07,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-04 17:13:07,339 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 144 flow. Second operand 5 states and 135 transitions. [2024-06-04 17:13:07,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 406 flow [2024-06-04 17:13:07,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 392 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 17:13:07,343 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 243 flow [2024-06-04 17:13:07,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2024-06-04 17:13:07,344 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2024-06-04 17:13:07,344 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 243 flow [2024-06-04 17:13:07,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:07,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:07,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:07,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:13:07,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:13:07,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash -732993944, now seen corresponding path program 1 times [2024-06-04 17:13:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036947397] [2024-06-04 17:13:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:13,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:13,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036947397] [2024-06-04 17:13:13,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036947397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:13,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:13,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:13:13,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283782648] [2024-06-04 17:13:13,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:13,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:13:13,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:13,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:13:13,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:13:13,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 17:13:13,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:13,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:13,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 17:13:13,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:14,347 INFO L124 PetriNetUnfolderBase]: 1580/2518 cut-off events. [2024-06-04 17:13:14,348 INFO L125 PetriNetUnfolderBase]: For 3183/3186 co-relation queries the response was YES. [2024-06-04 17:13:14,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7277 conditions, 2518 events. 1580/2518 cut-off events. For 3183/3186 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13269 event pairs, 481 based on Foata normal form. 12/2509 useless extension candidates. Maximal degree in co-relation 7257. Up to 2216 conditions per place. [2024-06-04 17:13:14,362 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 59 selfloop transitions, 19 changer transitions 0/85 dead transitions. [2024-06-04 17:13:14,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 509 flow [2024-06-04 17:13:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:13:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:13:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-06-04 17:13:14,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-06-04 17:13:14,364 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 243 flow. Second operand 6 states and 155 transitions. [2024-06-04 17:13:14,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 509 flow [2024-06-04 17:13:14,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 501 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 17:13:14,371 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 299 flow [2024-06-04 17:13:14,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-06-04 17:13:14,372 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2024-06-04 17:13:14,372 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 299 flow [2024-06-04 17:13:14,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:14,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:14,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:14,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:13:14,373 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-04 17:13:14,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1199250010, now seen corresponding path program 1 times [2024-06-04 17:13:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268229350] [2024-06-04 17:13:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:26,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268229350] [2024-06-04 17:13:26,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268229350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:26,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:13:26,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493963932] [2024-06-04 17:13:26,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:26,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:13:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:26,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:13:26,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:13:27,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 17:13:27,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:27,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:27,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 17:13:27,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:28,172 INFO L124 PetriNetUnfolderBase]: 1368/2247 cut-off events. [2024-06-04 17:13:28,173 INFO L125 PetriNetUnfolderBase]: For 4097/4097 co-relation queries the response was YES. [2024-06-04 17:13:28,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 2247 events. 1368/2247 cut-off events. For 4097/4097 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12074 event pairs, 562 based on Foata normal form. 2/2211 useless extension candidates. Maximal degree in co-relation 6996. Up to 2036 conditions per place. [2024-06-04 17:13:28,185 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 50 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2024-06-04 17:13:28,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 443 flow [2024-06-04 17:13:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:13:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:13:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-06-04 17:13:28,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2024-06-04 17:13:28,186 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 299 flow. Second operand 5 states and 111 transitions. [2024-06-04 17:13:28,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 443 flow [2024-06-04 17:13:28,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 393 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 17:13:28,190 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 273 flow [2024-06-04 17:13:28,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-06-04 17:13:28,190 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2024-06-04 17:13:28,190 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 273 flow [2024-06-04 17:13:28,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:28,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:28,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:28,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:13:28,191 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-04 17:13:28,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1447483434, now seen corresponding path program 1 times [2024-06-04 17:13:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549957530] [2024-06-04 17:13:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:42,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549957530] [2024-06-04 17:13:42,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549957530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:42,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:42,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:13:42,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925446899] [2024-06-04 17:13:42,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:42,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:13:42,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:42,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:13:42,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:13:42,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:13:42,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:42,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:42,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:13:42,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:43,901 INFO L124 PetriNetUnfolderBase]: 1606/2616 cut-off events. [2024-06-04 17:13:43,901 INFO L125 PetriNetUnfolderBase]: For 5550/5550 co-relation queries the response was YES. [2024-06-04 17:13:43,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8117 conditions, 2616 events. 1606/2616 cut-off events. For 5550/5550 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13993 event pairs, 676 based on Foata normal form. 2/2592 useless extension candidates. Maximal degree in co-relation 8092. Up to 2373 conditions per place. [2024-06-04 17:13:43,925 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 55 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-06-04 17:13:43,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 461 flow [2024-06-04 17:13:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:13:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:13:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-04 17:13:43,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-04 17:13:43,926 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 273 flow. Second operand 6 states and 126 transitions. [2024-06-04 17:13:43,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 461 flow [2024-06-04 17:13:43,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 439 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:13:43,930 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 305 flow [2024-06-04 17:13:43,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2024-06-04 17:13:43,931 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2024-06-04 17:13:43,931 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 305 flow [2024-06-04 17:13:43,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:43,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:43,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:43,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:13:43,932 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-04 17:13:43,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1916593059, now seen corresponding path program 1 times [2024-06-04 17:13:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:43,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201983648] [2024-06-04 17:13:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:58,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201983648] [2024-06-04 17:13:58,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201983648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:13:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537911951] [2024-06-04 17:13:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:58,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:13:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:13:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:13:58,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:13:58,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:58,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:58,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:13:58,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:00,293 INFO L124 PetriNetUnfolderBase]: 1746/2778 cut-off events. [2024-06-04 17:14:00,294 INFO L125 PetriNetUnfolderBase]: For 8538/8544 co-relation queries the response was YES. [2024-06-04 17:14:00,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9398 conditions, 2778 events. 1746/2778 cut-off events. For 8538/8544 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14653 event pairs, 726 based on Foata normal form. 8/2770 useless extension candidates. Maximal degree in co-relation 9373. Up to 2505 conditions per place. [2024-06-04 17:14:00,307 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 54 selfloop transitions, 19 changer transitions 0/81 dead transitions. [2024-06-04 17:14:00,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 547 flow [2024-06-04 17:14:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:14:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:14:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-06-04 17:14:00,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-04 17:14:00,309 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 305 flow. Second operand 6 states and 135 transitions. [2024-06-04 17:14:00,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 547 flow [2024-06-04 17:14:00,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 517 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:00,313 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 347 flow [2024-06-04 17:14:00,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-06-04 17:14:00,314 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2024-06-04 17:14:00,314 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 347 flow [2024-06-04 17:14:00,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:00,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:00,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:00,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:14:00,315 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-04 17:14:00,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1427987707, now seen corresponding path program 2 times [2024-06-04 17:14:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:00,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009828751] [2024-06-04 17:14:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009828751] [2024-06-04 17:14:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009828751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:13,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:14:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754167615] [2024-06-04 17:14:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:13,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:14:13,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:14:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:14:13,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:14:13,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:13,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:13,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:14:13,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:15,133 INFO L124 PetriNetUnfolderBase]: 1734/2751 cut-off events. [2024-06-04 17:14:15,133 INFO L125 PetriNetUnfolderBase]: For 10319/10325 co-relation queries the response was YES. [2024-06-04 17:14:15,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9634 conditions, 2751 events. 1734/2751 cut-off events. For 10319/10325 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14473 event pairs, 740 based on Foata normal form. 3/2733 useless extension candidates. Maximal degree in co-relation 9608. Up to 2489 conditions per place. [2024-06-04 17:14:15,146 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 48 selfloop transitions, 20 changer transitions 0/76 dead transitions. [2024-06-04 17:14:15,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 521 flow [2024-06-04 17:14:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:14:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:14:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-04 17:14:15,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2024-06-04 17:14:15,148 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 347 flow. Second operand 6 states and 131 transitions. [2024-06-04 17:14:15,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 521 flow [2024-06-04 17:14:15,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 76 transitions, 492 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:14:15,153 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 366 flow [2024-06-04 17:14:15,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-06-04 17:14:15,154 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-06-04 17:14:15,154 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 366 flow [2024-06-04 17:14:15,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:15,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:15,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:15,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:14:15,155 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-04 17:14:15,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:15,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1922314915, now seen corresponding path program 1 times [2024-06-04 17:14:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512420070] [2024-06-04 17:14:15,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:30,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512420070] [2024-06-04 17:14:30,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512420070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:30,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:30,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:14:30,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032094178] [2024-06-04 17:14:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:30,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:14:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:14:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:14:30,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:14:30,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:30,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:30,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:14:30,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:32,104 INFO L124 PetriNetUnfolderBase]: 1590/2611 cut-off events. [2024-06-04 17:14:32,104 INFO L125 PetriNetUnfolderBase]: For 10273/10273 co-relation queries the response was YES. [2024-06-04 17:14:32,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9114 conditions, 2611 events. 1590/2611 cut-off events. For 10273/10273 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14033 event pairs, 634 based on Foata normal form. 4/2601 useless extension candidates. Maximal degree in co-relation 9087. Up to 2330 conditions per place. [2024-06-04 17:14:32,116 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 63 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-06-04 17:14:32,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 592 flow [2024-06-04 17:14:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:14:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:14:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-04 17:14:32,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-04 17:14:32,118 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 366 flow. Second operand 7 states and 146 transitions. [2024-06-04 17:14:32,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 592 flow [2024-06-04 17:14:32,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 527 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:14:32,125 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 365 flow [2024-06-04 17:14:32,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=365, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2024-06-04 17:14:32,126 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2024-06-04 17:14:32,126 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 365 flow [2024-06-04 17:14:32,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:32,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:32,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:32,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:14:32,127 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-04 17:14:32,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -715155925, now seen corresponding path program 1 times [2024-06-04 17:14:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540005438] [2024-06-04 17:14:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:47,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:47,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540005438] [2024-06-04 17:14:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540005438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:47,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:47,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:14:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850759349] [2024-06-04 17:14:47,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:47,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:14:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:47,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:14:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:14:47,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:14:47,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 365 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:47,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:47,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:14:47,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:48,951 INFO L124 PetriNetUnfolderBase]: 1856/2900 cut-off events. [2024-06-04 17:14:48,951 INFO L125 PetriNetUnfolderBase]: For 14773/14779 co-relation queries the response was YES. [2024-06-04 17:14:48,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10882 conditions, 2900 events. 1856/2900 cut-off events. For 14773/14779 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14909 event pairs, 731 based on Foata normal form. 5/2888 useless extension candidates. Maximal degree in co-relation 10854. Up to 2601 conditions per place. [2024-06-04 17:14:48,981 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 64 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2024-06-04 17:14:48,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 697 flow [2024-06-04 17:14:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:14:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:14:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-06-04 17:14:48,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2024-06-04 17:14:48,982 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 365 flow. Second operand 7 states and 151 transitions. [2024-06-04 17:14:48,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 697 flow [2024-06-04 17:14:48,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 657 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-04 17:14:48,988 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 444 flow [2024-06-04 17:14:48,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2024-06-04 17:14:48,989 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2024-06-04 17:14:48,989 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 444 flow [2024-06-04 17:14:48,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:14:48,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:48,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:48,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:14:48,990 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:14:48,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1317707417, now seen corresponding path program 2 times [2024-06-04 17:14:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:48,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58990755] [2024-06-04 17:14:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58990755] [2024-06-04 17:15:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58990755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:04,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:04,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:15:04,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524707608] [2024-06-04 17:15:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:04,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:15:04,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:04,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:15:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:15:04,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:15:04,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 444 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:04,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:04,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:15:04,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:05,862 INFO L124 PetriNetUnfolderBase]: 1867/2908 cut-off events. [2024-06-04 17:15:05,862 INFO L125 PetriNetUnfolderBase]: For 18390/18396 co-relation queries the response was YES. [2024-06-04 17:15:05,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11747 conditions, 2908 events. 1867/2908 cut-off events. For 18390/18396 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14909 event pairs, 745 based on Foata normal form. 3/2887 useless extension candidates. Maximal degree in co-relation 11718. Up to 2608 conditions per place. [2024-06-04 17:15:05,876 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 60 selfloop transitions, 34 changer transitions 0/100 dead transitions. [2024-06-04 17:15:05,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 100 transitions, 828 flow [2024-06-04 17:15:05,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:15:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:15:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-06-04 17:15:05,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2024-06-04 17:15:05,877 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 444 flow. Second operand 7 states and 151 transitions. [2024-06-04 17:15:05,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 100 transitions, 828 flow [2024-06-04 17:15:05,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 792 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-04 17:15:05,885 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 546 flow [2024-06-04 17:15:05,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2024-06-04 17:15:05,886 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2024-06-04 17:15:05,886 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 546 flow [2024-06-04 17:15:05,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:05,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:05,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:05,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:15:05,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:15:05,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -538024405, now seen corresponding path program 3 times [2024-06-04 17:15:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336472131] [2024-06-04 17:15:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336472131] [2024-06-04 17:15:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336472131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:20,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:20,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:15:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544379251] [2024-06-04 17:15:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:20,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:15:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:15:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:15:20,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:15:20,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:20,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:20,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:15:20,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:22,415 INFO L124 PetriNetUnfolderBase]: 1862/2901 cut-off events. [2024-06-04 17:15:22,416 INFO L125 PetriNetUnfolderBase]: For 21732/21738 co-relation queries the response was YES. [2024-06-04 17:15:22,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12217 conditions, 2901 events. 1862/2901 cut-off events. For 21732/21738 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14889 event pairs, 745 based on Foata normal form. 3/2880 useless extension candidates. Maximal degree in co-relation 12186. Up to 2605 conditions per place. [2024-06-04 17:15:22,448 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 59 selfloop transitions, 33 changer transitions 0/98 dead transitions. [2024-06-04 17:15:22,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 98 transitions, 826 flow [2024-06-04 17:15:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:15:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:15:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-04 17:15:22,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2024-06-04 17:15:22,450 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 546 flow. Second operand 7 states and 149 transitions. [2024-06-04 17:15:22,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 98 transitions, 826 flow [2024-06-04 17:15:22,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 98 transitions, 764 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-04 17:15:22,465 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 558 flow [2024-06-04 17:15:22,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=558, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2024-06-04 17:15:22,466 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places. [2024-06-04 17:15:22,466 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 558 flow [2024-06-04 17:15:22,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:22,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:22,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:22,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:15:22,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:15:22,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1407223686, now seen corresponding path program 1 times [2024-06-04 17:15:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:22,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155790875] [2024-06-04 17:15:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:22,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:37,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:37,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155790875] [2024-06-04 17:15:37,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155790875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:37,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:37,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:15:37,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376968240] [2024-06-04 17:15:37,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:37,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:15:37,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:37,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:15:37,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:15:37,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 17:15:37,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 558 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:37,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:37,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 17:15:37,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:38,725 INFO L124 PetriNetUnfolderBase]: 1534/2566 cut-off events. [2024-06-04 17:15:38,726 INFO L125 PetriNetUnfolderBase]: For 20486/20486 co-relation queries the response was YES. [2024-06-04 17:15:38,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10648 conditions, 2566 events. 1534/2566 cut-off events. For 20486/20486 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14034 event pairs, 581 based on Foata normal form. 1/2551 useless extension candidates. Maximal degree in co-relation 10615. Up to 2252 conditions per place. [2024-06-04 17:15:38,739 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 67 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2024-06-04 17:15:38,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 750 flow [2024-06-04 17:15:38,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:15:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:15:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-04 17:15:38,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47555555555555556 [2024-06-04 17:15:38,741 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 558 flow. Second operand 5 states and 107 transitions. [2024-06-04 17:15:38,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 750 flow [2024-06-04 17:15:38,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 88 transitions, 669 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:15:38,752 INFO L231 Difference]: Finished difference. Result has 77 places, 80 transitions, 527 flow [2024-06-04 17:15:38,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=77, PETRI_TRANSITIONS=80} [2024-06-04 17:15:38,754 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places. [2024-06-04 17:15:38,754 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 80 transitions, 527 flow [2024-06-04 17:15:38,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:15:38,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:38,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:38,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:15:38,754 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-04 17:15:38,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 176936383, now seen corresponding path program 1 times [2024-06-04 17:15:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:38,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414538620] [2024-06-04 17:15:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:15:53,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:53,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414538620] [2024-06-04 17:15:53,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414538620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:53,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:53,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:15:53,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393745463] [2024-06-04 17:15:53,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:53,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:15:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:53,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:15:53,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:15:53,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:15:53,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 80 transitions, 527 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-04 17:15:53,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:53,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:15:53,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:55,196 INFO L124 PetriNetUnfolderBase]: 1886/2949 cut-off events. [2024-06-04 17:15:55,197 INFO L125 PetriNetUnfolderBase]: For 27374/27377 co-relation queries the response was YES. [2024-06-04 17:15:55,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12983 conditions, 2949 events. 1886/2949 cut-off events. For 27374/27377 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15172 event pairs, 730 based on Foata normal form. 2/2947 useless extension candidates. Maximal degree in co-relation 12949. Up to 2630 conditions per place. [2024-06-04 17:15:55,212 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 70 selfloop transitions, 36 changer transitions 0/112 dead transitions. [2024-06-04 17:15:55,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 971 flow [2024-06-04 17:15:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:15:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:15:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-04 17:15:55,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-04 17:15:55,214 INFO L175 Difference]: Start difference. First operand has 77 places, 80 transitions, 527 flow. Second operand 7 states and 152 transitions. [2024-06-04 17:15:55,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 971 flow [2024-06-04 17:15:55,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 943 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-04 17:15:55,228 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 648 flow [2024-06-04 17:15:55,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=648, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2024-06-04 17:15:55,229 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-06-04 17:15:55,229 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 648 flow [2024-06-04 17:15:55,229 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-04 17:15:55,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:55,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:55,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:15:55,230 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-04 17:15:55,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash 484567524, now seen corresponding path program 1 times [2024-06-04 17:15:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873895189] [2024-06-04 17:15:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:05,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873895189] [2024-06-04 17:16:05,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873895189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:05,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:05,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:16:05,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550122182] [2024-06-04 17:16:05,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:05,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:16:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:16:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:16:05,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:16:05,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 648 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:05,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:05,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:16:05,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:07,365 INFO L124 PetriNetUnfolderBase]: 2100/3287 cut-off events. [2024-06-04 17:16:07,366 INFO L125 PetriNetUnfolderBase]: For 33546/33549 co-relation queries the response was YES. [2024-06-04 17:16:07,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 3287 events. 2100/3287 cut-off events. For 33546/33549 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17079 event pairs, 686 based on Foata normal form. 8/3285 useless extension candidates. Maximal degree in co-relation 14954. Up to 2631 conditions per place. [2024-06-04 17:16:07,383 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 91 selfloop transitions, 56 changer transitions 0/153 dead transitions. [2024-06-04 17:16:07,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 153 transitions, 1472 flow [2024-06-04 17:16:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-06-04 17:16:07,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47160493827160493 [2024-06-04 17:16:07,385 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 648 flow. Second operand 9 states and 191 transitions. [2024-06-04 17:16:07,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 153 transitions, 1472 flow [2024-06-04 17:16:07,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 1379 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-04 17:16:07,406 INFO L231 Difference]: Finished difference. Result has 92 places, 116 transitions, 1058 flow [2024-06-04 17:16:07,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1058, PETRI_PLACES=92, PETRI_TRANSITIONS=116} [2024-06-04 17:16:07,407 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2024-06-04 17:16:07,407 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 116 transitions, 1058 flow [2024-06-04 17:16:07,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:07,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:07,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:07,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:16:07,408 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-04 17:16:07,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1944440732, now seen corresponding path program 2 times [2024-06-04 17:16:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:07,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681146926] [2024-06-04 17:16:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:22,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:22,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681146926] [2024-06-04 17:16:22,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681146926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:22,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:22,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:16:22,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299125987] [2024-06-04 17:16:22,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:22,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:16:22,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:22,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:16:22,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:16:22,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:16:22,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 116 transitions, 1058 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:22,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:22,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:16:22,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:24,575 INFO L124 PetriNetUnfolderBase]: 2333/3628 cut-off events. [2024-06-04 17:16:24,576 INFO L125 PetriNetUnfolderBase]: For 42657/42662 co-relation queries the response was YES. [2024-06-04 17:16:24,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18176 conditions, 3628 events. 2333/3628 cut-off events. For 42657/42662 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18847 event pairs, 529 based on Foata normal form. 10/3634 useless extension candidates. Maximal degree in co-relation 18135. Up to 2779 conditions per place. [2024-06-04 17:16:24,593 INFO L140 encePairwiseOnDemand]: 31/45 looper letters, 109 selfloop transitions, 97 changer transitions 0/212 dead transitions. [2024-06-04 17:16:24,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 212 transitions, 2329 flow [2024-06-04 17:16:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:16:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:16:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-06-04 17:16:24,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2024-06-04 17:16:24,595 INFO L175 Difference]: Start difference. First operand has 92 places, 116 transitions, 1058 flow. Second operand 9 states and 201 transitions. [2024-06-04 17:16:24,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 212 transitions, 2329 flow [2024-06-04 17:16:24,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 212 transitions, 2249 flow, removed 39 selfloop flow, removed 1 redundant places. [2024-06-04 17:16:24,623 INFO L231 Difference]: Finished difference. Result has 104 places, 158 transitions, 1796 flow [2024-06-04 17:16:24,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1796, PETRI_PLACES=104, PETRI_TRANSITIONS=158} [2024-06-04 17:16:24,624 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places. [2024-06-04 17:16:24,624 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 158 transitions, 1796 flow [2024-06-04 17:16:24,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:24,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:24,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:24,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:16:24,625 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:16:24,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 484561727, now seen corresponding path program 2 times [2024-06-04 17:16:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:24,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339639530] [2024-06-04 17:16:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:35,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:35,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339639530] [2024-06-04 17:16:35,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339639530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:35,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:35,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:16:35,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380283718] [2024-06-04 17:16:35,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:35,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:16:35,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:35,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:16:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:16:35,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:16:35,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 158 transitions, 1796 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-04 17:16:35,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:35,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:16:35,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:37,400 INFO L124 PetriNetUnfolderBase]: 2325/3636 cut-off events. [2024-06-04 17:16:37,400 INFO L125 PetriNetUnfolderBase]: For 48098/48105 co-relation queries the response was YES. [2024-06-04 17:16:37,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19337 conditions, 3636 events. 2325/3636 cut-off events. For 48098/48105 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18998 event pairs, 655 based on Foata normal form. 7/3633 useless extension candidates. Maximal degree in co-relation 19289. Up to 3100 conditions per place. [2024-06-04 17:16:37,423 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 101 selfloop transitions, 80 changer transitions 0/187 dead transitions. [2024-06-04 17:16:37,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 187 transitions, 2394 flow [2024-06-04 17:16:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:16:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:16:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-06-04 17:16:37,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-04 17:16:37,435 INFO L175 Difference]: Start difference. First operand has 104 places, 158 transitions, 1796 flow. Second operand 8 states and 168 transitions. [2024-06-04 17:16:37,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 187 transitions, 2394 flow [2024-06-04 17:16:37,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 187 transitions, 2243 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-04 17:16:37,472 INFO L231 Difference]: Finished difference. Result has 109 places, 162 transitions, 1911 flow [2024-06-04 17:16:37,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1911, PETRI_PLACES=109, PETRI_TRANSITIONS=162} [2024-06-04 17:16:37,473 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places. [2024-06-04 17:16:37,473 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 162 transitions, 1911 flow [2024-06-04 17:16:37,474 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-04 17:16:37,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:37,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:37,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:16:37,474 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-04 17:16:37,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1453320672, now seen corresponding path program 3 times [2024-06-04 17:16:37,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:37,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628552380] [2024-06-04 17:16:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:16:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628552380] [2024-06-04 17:16:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628552380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:53,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:53,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:16:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201964418] [2024-06-04 17:16:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:53,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:16:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:53,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:16:53,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:16:53,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:16:53,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 162 transitions, 1911 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:53,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:53,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:16:53,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:55,147 INFO L124 PetriNetUnfolderBase]: 2413/3740 cut-off events. [2024-06-04 17:16:55,147 INFO L125 PetriNetUnfolderBase]: For 55847/55849 co-relation queries the response was YES. [2024-06-04 17:16:55,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20511 conditions, 3740 events. 2413/3740 cut-off events. For 55847/55849 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19363 event pairs, 543 based on Foata normal form. 6/3715 useless extension candidates. Maximal degree in co-relation 20460. Up to 2813 conditions per place. [2024-06-04 17:16:55,170 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 87 selfloop transitions, 118 changer transitions 0/211 dead transitions. [2024-06-04 17:16:55,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 211 transitions, 2837 flow [2024-06-04 17:16:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:16:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:16:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-04 17:16:55,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-06-04 17:16:55,172 INFO L175 Difference]: Start difference. First operand has 109 places, 162 transitions, 1911 flow. Second operand 8 states and 178 transitions. [2024-06-04 17:16:55,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 211 transitions, 2837 flow [2024-06-04 17:16:55,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 211 transitions, 2746 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-04 17:16:55,214 INFO L231 Difference]: Finished difference. Result has 114 places, 177 transitions, 2284 flow [2024-06-04 17:16:55,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2284, PETRI_PLACES=114, PETRI_TRANSITIONS=177} [2024-06-04 17:16:55,215 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 68 predicate places. [2024-06-04 17:16:55,216 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 177 transitions, 2284 flow [2024-06-04 17:16:55,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:16:55,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:55,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:55,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:16:55,216 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-04 17:16:55,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash 628458054, now seen corresponding path program 4 times [2024-06-04 17:16:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:55,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42609382] [2024-06-04 17:16:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:05,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:05,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42609382] [2024-06-04 17:17:05,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42609382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:05,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:05,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:17:05,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366848066] [2024-06-04 17:17:05,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:05,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:17:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:05,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:17:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:17:05,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:17:05,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 177 transitions, 2284 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:05,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:05,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:17:05,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:07,814 INFO L124 PetriNetUnfolderBase]: 2397/3719 cut-off events. [2024-06-04 17:17:07,814 INFO L125 PetriNetUnfolderBase]: For 62930/62932 co-relation queries the response was YES. [2024-06-04 17:17:07,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21078 conditions, 3719 events. 2397/3719 cut-off events. For 62930/62932 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19249 event pairs, 562 based on Foata normal form. 8/3698 useless extension candidates. Maximal degree in co-relation 21026. Up to 2806 conditions per place. [2024-06-04 17:17:07,836 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 86 selfloop transitions, 117 changer transitions 0/209 dead transitions. [2024-06-04 17:17:07,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 209 transitions, 2932 flow [2024-06-04 17:17:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:17:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:17:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2024-06-04 17:17:07,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-04 17:17:07,837 INFO L175 Difference]: Start difference. First operand has 114 places, 177 transitions, 2284 flow. Second operand 9 states and 190 transitions. [2024-06-04 17:17:07,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 209 transitions, 2932 flow [2024-06-04 17:17:07,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 209 transitions, 2837 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-04 17:17:07,892 INFO L231 Difference]: Finished difference. Result has 121 places, 177 transitions, 2433 flow [2024-06-04 17:17:07,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2189, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2433, PETRI_PLACES=121, PETRI_TRANSITIONS=177} [2024-06-04 17:17:07,893 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 75 predicate places. [2024-06-04 17:17:07,893 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 177 transitions, 2433 flow [2024-06-04 17:17:07,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:07,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:07,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:07,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:17:07,893 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-04 17:17:07,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1199561089, now seen corresponding path program 3 times [2024-06-04 17:17:07,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:07,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066855226] [2024-06-04 17:17:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066855226] [2024-06-04 17:17:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066855226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:17:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049030101] [2024-06-04 17:17:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:17:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:17:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:17:22,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:17:22,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 177 transitions, 2433 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-04 17:17:22,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:22,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:17:22,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:24,452 INFO L124 PetriNetUnfolderBase]: 2389/3747 cut-off events. [2024-06-04 17:17:24,453 INFO L125 PetriNetUnfolderBase]: For 66833/66838 co-relation queries the response was YES. [2024-06-04 17:17:24,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21530 conditions, 3747 events. 2389/3747 cut-off events. For 66833/66838 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19701 event pairs, 669 based on Foata normal form. 5/3734 useless extension candidates. Maximal degree in co-relation 21475. Up to 3196 conditions per place. [2024-06-04 17:17:24,481 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 120 selfloop transitions, 73 changer transitions 0/199 dead transitions. [2024-06-04 17:17:24,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 199 transitions, 2967 flow [2024-06-04 17:17:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:17:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:17:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-04 17:17:24,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-04 17:17:24,484 INFO L175 Difference]: Start difference. First operand has 121 places, 177 transitions, 2433 flow. Second operand 7 states and 146 transitions. [2024-06-04 17:17:24,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 199 transitions, 2967 flow [2024-06-04 17:17:24,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 199 transitions, 2649 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 17:17:24,545 INFO L231 Difference]: Finished difference. Result has 120 places, 177 transitions, 2271 flow [2024-06-04 17:17:24,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2271, PETRI_PLACES=120, PETRI_TRANSITIONS=177} [2024-06-04 17:17:24,546 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 74 predicate places. [2024-06-04 17:17:24,546 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 177 transitions, 2271 flow [2024-06-04 17:17:24,546 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-04 17:17:24,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:24,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:24,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:17:24,547 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-04 17:17:24,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2101011364, now seen corresponding path program 5 times [2024-06-04 17:17:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:24,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426075875] [2024-06-04 17:17:24,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426075875] [2024-06-04 17:17:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426075875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:40,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:17:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051922047] [2024-06-04 17:17:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:40,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:17:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:17:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:17:41,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:17:41,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 177 transitions, 2271 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:41,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:41,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:17:41,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:42,965 INFO L124 PetriNetUnfolderBase]: 2373/3685 cut-off events. [2024-06-04 17:17:42,966 INFO L125 PetriNetUnfolderBase]: For 69228/69230 co-relation queries the response was YES. [2024-06-04 17:17:42,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21078 conditions, 3685 events. 2373/3685 cut-off events. For 69228/69230 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 19084 event pairs, 540 based on Foata normal form. 6/3660 useless extension candidates. Maximal degree in co-relation 21023. Up to 2794 conditions per place. [2024-06-04 17:17:42,991 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 79 selfloop transitions, 122 changer transitions 0/207 dead transitions. [2024-06-04 17:17:42,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 207 transitions, 2847 flow [2024-06-04 17:17:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:17:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:17:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-06-04 17:17:42,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-06-04 17:17:42,992 INFO L175 Difference]: Start difference. First operand has 120 places, 177 transitions, 2271 flow. Second operand 8 states and 173 transitions. [2024-06-04 17:17:42,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 207 transitions, 2847 flow [2024-06-04 17:17:43,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 207 transitions, 2629 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 17:17:43,045 INFO L231 Difference]: Finished difference. Result has 122 places, 177 transitions, 2307 flow [2024-06-04 17:17:43,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2307, PETRI_PLACES=122, PETRI_TRANSITIONS=177} [2024-06-04 17:17:43,046 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 76 predicate places. [2024-06-04 17:17:43,046 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 177 transitions, 2307 flow [2024-06-04 17:17:43,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:17:43,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:43,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:43,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:17:43,047 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:17:43,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1943610459, now seen corresponding path program 4 times [2024-06-04 17:17:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:43,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42643440] [2024-06-04 17:17:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:17:53,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42643440] [2024-06-04 17:17:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42643440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:53,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:53,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:17:53,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240438038] [2024-06-04 17:17:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:53,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:17:53,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:53,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:17:53,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:17:53,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:17:53,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 177 transitions, 2307 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-04 17:17:53,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:53,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:17:53,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:55,120 INFO L124 PetriNetUnfolderBase]: 2415/3788 cut-off events. [2024-06-04 17:17:55,120 INFO L125 PetriNetUnfolderBase]: For 74866/74873 co-relation queries the response was YES. [2024-06-04 17:17:55,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22091 conditions, 3788 events. 2415/3788 cut-off events. For 74866/74873 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 19971 event pairs, 629 based on Foata normal form. 6/3790 useless extension candidates. Maximal degree in co-relation 22035. Up to 3211 conditions per place. [2024-06-04 17:17:55,147 INFO L140 encePairwiseOnDemand]: 32/45 looper letters, 125 selfloop transitions, 104 changer transitions 0/235 dead transitions. [2024-06-04 17:17:55,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 235 transitions, 3328 flow [2024-06-04 17:17:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:17:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:17:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-04 17:17:55,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-04 17:17:55,149 INFO L175 Difference]: Start difference. First operand has 122 places, 177 transitions, 2307 flow. Second operand 8 states and 172 transitions. [2024-06-04 17:17:55,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 235 transitions, 3328 flow [2024-06-04 17:17:55,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 235 transitions, 2933 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:17:55,206 INFO L231 Difference]: Finished difference. Result has 125 places, 207 transitions, 2718 flow [2024-06-04 17:17:55,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2718, PETRI_PLACES=125, PETRI_TRANSITIONS=207} [2024-06-04 17:17:55,206 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 79 predicate places. [2024-06-04 17:17:55,206 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 207 transitions, 2718 flow [2024-06-04 17:17:55,208 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-04 17:17:55,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:55,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:55,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:17:55,209 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-04 17:17:55,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -656385548, now seen corresponding path program 1 times [2024-06-04 17:17:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117465358] [2024-06-04 17:17:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117465358] [2024-06-04 17:18:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117465358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:18:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450149955] [2024-06-04 17:18:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:11,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:18:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:18:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:18:11,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:18:11,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 207 transitions, 2718 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-04 17:18:11,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:11,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:18:11,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:13,156 INFO L124 PetriNetUnfolderBase]: 2301/3670 cut-off events. [2024-06-04 17:18:13,156 INFO L125 PetriNetUnfolderBase]: For 78893/78897 co-relation queries the response was YES. [2024-06-04 17:18:13,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21522 conditions, 3670 events. 2301/3670 cut-off events. For 78893/78897 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 19778 event pairs, 700 based on Foata normal form. 3/3644 useless extension candidates. Maximal degree in co-relation 21463. Up to 3315 conditions per place. [2024-06-04 17:18:13,184 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 179 selfloop transitions, 12 changer transitions 0/218 dead transitions. [2024-06-04 17:18:13,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 218 transitions, 3148 flow [2024-06-04 17:18:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:18:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:18:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-04 17:18:13,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2024-06-04 17:18:13,185 INFO L175 Difference]: Start difference. First operand has 125 places, 207 transitions, 2718 flow. Second operand 6 states and 119 transitions. [2024-06-04 17:18:13,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 218 transitions, 3148 flow [2024-06-04 17:18:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 218 transitions, 2865 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-04 17:18:13,258 INFO L231 Difference]: Finished difference. Result has 125 places, 210 transitions, 2497 flow [2024-06-04 17:18:13,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2435, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2497, PETRI_PLACES=125, PETRI_TRANSITIONS=210} [2024-06-04 17:18:13,258 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 79 predicate places. [2024-06-04 17:18:13,259 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 210 transitions, 2497 flow [2024-06-04 17:18:13,259 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-04 17:18:13,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:13,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:13,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:18:13,259 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:18:13,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:13,260 INFO L85 PathProgramCache]: Analyzing trace with hash 46891156, now seen corresponding path program 1 times [2024-06-04 17:18:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:13,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334137266] [2024-06-04 17:18:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:29,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:29,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334137266] [2024-06-04 17:18:29,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334137266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:29,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:29,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:18:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257223350] [2024-06-04 17:18:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:18:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:18:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:18:29,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:18:29,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 210 transitions, 2497 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:29,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:29,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:18:29,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:31,480 INFO L124 PetriNetUnfolderBase]: 2381/3765 cut-off events. [2024-06-04 17:18:31,480 INFO L125 PetriNetUnfolderBase]: For 93849/93859 co-relation queries the response was YES. [2024-06-04 17:18:31,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22852 conditions, 3765 events. 2381/3765 cut-off events. For 93849/93859 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 20270 event pairs, 667 based on Foata normal form. 9/3760 useless extension candidates. Maximal degree in co-relation 22793. Up to 3215 conditions per place. [2024-06-04 17:18:31,506 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 154 selfloop transitions, 53 changer transitions 0/235 dead transitions. [2024-06-04 17:18:31,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 235 transitions, 3017 flow [2024-06-04 17:18:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:18:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:18:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-04 17:18:31,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-04 17:18:31,516 INFO L175 Difference]: Start difference. First operand has 125 places, 210 transitions, 2497 flow. Second operand 7 states and 152 transitions. [2024-06-04 17:18:31,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 235 transitions, 3017 flow [2024-06-04 17:18:31,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 235 transitions, 2977 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 17:18:31,582 INFO L231 Difference]: Finished difference. Result has 128 places, 212 transitions, 2601 flow [2024-06-04 17:18:31,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2457, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2601, PETRI_PLACES=128, PETRI_TRANSITIONS=212} [2024-06-04 17:18:31,583 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 82 predicate places. [2024-06-04 17:18:31,583 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 212 transitions, 2601 flow [2024-06-04 17:18:31,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:31,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:31,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:31,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:18:31,583 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-04 17:18:31,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash 49569556, now seen corresponding path program 2 times [2024-06-04 17:18:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:31,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738214452] [2024-06-04 17:18:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:18:47,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738214452] [2024-06-04 17:18:47,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738214452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:47,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:47,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:18:47,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895200943] [2024-06-04 17:18:47,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:47,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:18:47,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:18:47,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:18:47,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:18:47,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 212 transitions, 2601 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:47,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:47,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:18:47,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:49,087 INFO L124 PetriNetUnfolderBase]: 2367/3766 cut-off events. [2024-06-04 17:18:49,087 INFO L125 PetriNetUnfolderBase]: For 100785/100790 co-relation queries the response was YES. [2024-06-04 17:18:49,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23410 conditions, 3766 events. 2367/3766 cut-off events. For 100785/100790 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 20376 event pairs, 515 based on Foata normal form. 6/3768 useless extension candidates. Maximal degree in co-relation 23350. Up to 3088 conditions per place. [2024-06-04 17:18:49,116 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 163 selfloop transitions, 46 changer transitions 0/237 dead transitions. [2024-06-04 17:18:49,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 237 transitions, 3121 flow [2024-06-04 17:18:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:18:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:18:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-04 17:18:49,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-04 17:18:49,119 INFO L175 Difference]: Start difference. First operand has 128 places, 212 transitions, 2601 flow. Second operand 7 states and 152 transitions. [2024-06-04 17:18:49,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 237 transitions, 3121 flow [2024-06-04 17:18:49,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 237 transitions, 3001 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 17:18:49,189 INFO L231 Difference]: Finished difference. Result has 130 places, 214 transitions, 2612 flow [2024-06-04 17:18:49,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2612, PETRI_PLACES=130, PETRI_TRANSITIONS=214} [2024-06-04 17:18:49,189 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 84 predicate places. [2024-06-04 17:18:49,189 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 214 transitions, 2612 flow [2024-06-04 17:18:49,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:18:49,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:49,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:49,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:18:49,190 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:18:49,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -70210800, now seen corresponding path program 1 times [2024-06-04 17:18:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:49,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492645310] [2024-06-04 17:18:49,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:04,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492645310] [2024-06-04 17:19:04,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492645310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:04,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:04,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:19:04,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682498809] [2024-06-04 17:19:04,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:04,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:19:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:04,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:19:04,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:19:04,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:19:04,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 214 transitions, 2612 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:19:04,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:04,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:19:04,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:06,974 INFO L124 PetriNetUnfolderBase]: 2550/3996 cut-off events. [2024-06-04 17:19:06,974 INFO L125 PetriNetUnfolderBase]: For 110564/110571 co-relation queries the response was YES. [2024-06-04 17:19:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24945 conditions, 3996 events. 2550/3996 cut-off events. For 110564/110571 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 21372 event pairs, 600 based on Foata normal form. 14/4006 useless extension candidates. Maximal degree in co-relation 24884. Up to 2958 conditions per place. [2024-06-04 17:19:07,007 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 105 selfloop transitions, 148 changer transitions 0/260 dead transitions. [2024-06-04 17:19:07,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 260 transitions, 3497 flow [2024-06-04 17:19:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:19:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:19:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-06-04 17:19:07,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2024-06-04 17:19:07,010 INFO L175 Difference]: Start difference. First operand has 130 places, 214 transitions, 2612 flow. Second operand 8 states and 179 transitions. [2024-06-04 17:19:07,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 260 transitions, 3497 flow [2024-06-04 17:19:07,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 3384 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-04 17:19:07,117 INFO L231 Difference]: Finished difference. Result has 133 places, 223 transitions, 2953 flow [2024-06-04 17:19:07,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2499, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2953, PETRI_PLACES=133, PETRI_TRANSITIONS=223} [2024-06-04 17:19:07,119 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places. [2024-06-04 17:19:07,119 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 223 transitions, 2953 flow [2024-06-04 17:19:07,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:19:07,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:07,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:07,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:19:07,131 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-04 17:19:07,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -70031310, now seen corresponding path program 2 times [2024-06-04 17:19:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:07,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231037274] [2024-06-04 17:19:07,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:23,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:23,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231037274] [2024-06-04 17:19:23,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231037274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:23,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:23,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:19:23,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222781923] [2024-06-04 17:19:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:23,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:19:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:23,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:19:23,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:19:24,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:19:24,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 223 transitions, 2953 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:19:24,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:24,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:19:24,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:26,237 INFO L124 PetriNetUnfolderBase]: 2660/4174 cut-off events. [2024-06-04 17:19:26,237 INFO L125 PetriNetUnfolderBase]: For 123893/123898 co-relation queries the response was YES. [2024-06-04 17:19:26,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27003 conditions, 4174 events. 2660/4174 cut-off events. For 123893/123898 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22562 event pairs, 574 based on Foata normal form. 10/4180 useless extension candidates. Maximal degree in co-relation 26941. Up to 3054 conditions per place. [2024-06-04 17:19:26,269 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 114 selfloop transitions, 152 changer transitions 0/273 dead transitions. [2024-06-04 17:19:26,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 273 transitions, 4064 flow [2024-06-04 17:19:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:19:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:19:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-04 17:19:26,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-04 17:19:26,273 INFO L175 Difference]: Start difference. First operand has 133 places, 223 transitions, 2953 flow. Second operand 8 states and 177 transitions. [2024-06-04 17:19:26,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 273 transitions, 4064 flow [2024-06-04 17:19:26,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 273 transitions, 3772 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-04 17:19:26,366 INFO L231 Difference]: Finished difference. Result has 136 places, 238 transitions, 3247 flow [2024-06-04 17:19:26,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2676, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3247, PETRI_PLACES=136, PETRI_TRANSITIONS=238} [2024-06-04 17:19:26,366 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 90 predicate places. [2024-06-04 17:19:26,367 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 238 transitions, 3247 flow [2024-06-04 17:19:26,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:19:26,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:26,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:26,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:19:26,367 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-04 17:19:26,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2136686050, now seen corresponding path program 3 times [2024-06-04 17:19:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:26,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429133983] [2024-06-04 17:19:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:37,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:37,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429133983] [2024-06-04 17:19:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429133983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:37,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:37,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:19:37,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127417272] [2024-06-04 17:19:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:37,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:19:37,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:37,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:19:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:19:37,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:19:37,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 238 transitions, 3247 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:19:37,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:37,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:19:37,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:39,576 INFO L124 PetriNetUnfolderBase]: 2634/4138 cut-off events. [2024-06-04 17:19:39,576 INFO L125 PetriNetUnfolderBase]: For 128924/128929 co-relation queries the response was YES. [2024-06-04 17:19:39,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26830 conditions, 4138 events. 2634/4138 cut-off events. For 128924/128929 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22363 event pairs, 569 based on Foata normal form. 10/4144 useless extension candidates. Maximal degree in co-relation 26767. Up to 3033 conditions per place. [2024-06-04 17:19:39,608 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 119 selfloop transitions, 148 changer transitions 0/274 dead transitions. [2024-06-04 17:19:39,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 274 transitions, 4015 flow [2024-06-04 17:19:39,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:19:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:19:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-04 17:19:39,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-04 17:19:39,611 INFO L175 Difference]: Start difference. First operand has 136 places, 238 transitions, 3247 flow. Second operand 8 states and 177 transitions. [2024-06-04 17:19:39,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 274 transitions, 4015 flow [2024-06-04 17:19:39,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 274 transitions, 3714 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-04 17:19:39,727 INFO L231 Difference]: Finished difference. Result has 140 places, 238 transitions, 3259 flow [2024-06-04 17:19:39,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3259, PETRI_PLACES=140, PETRI_TRANSITIONS=238} [2024-06-04 17:19:39,727 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 94 predicate places. [2024-06-04 17:19:39,727 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 238 transitions, 3259 flow [2024-06-04 17:19:39,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:19:39,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:39,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:39,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:19:39,728 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:19:39,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1125436419, now seen corresponding path program 1 times [2024-06-04 17:19:39,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015149550] [2024-06-04 17:19:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:19:54,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015149550] [2024-06-04 17:19:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015149550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:54,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:54,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:19:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555623343] [2024-06-04 17:19:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:54,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:19:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:54,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:19:54,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:19:54,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:19:54,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 238 transitions, 3259 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-04 17:19:54,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:54,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:19:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:56,555 INFO L124 PetriNetUnfolderBase]: 2544/4045 cut-off events. [2024-06-04 17:19:56,555 INFO L125 PetriNetUnfolderBase]: For 135793/135808 co-relation queries the response was YES. [2024-06-04 17:19:56,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26586 conditions, 4045 events. 2544/4045 cut-off events. For 135793/135808 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 22381 event pairs, 704 based on Foata normal form. 14/4031 useless extension candidates. Maximal degree in co-relation 26522. Up to 3603 conditions per place. [2024-06-04 17:19:56,587 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 209 selfloop transitions, 19 changer transitions 0/256 dead transitions. [2024-06-04 17:19:56,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 256 transitions, 3809 flow [2024-06-04 17:19:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:19:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:19:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-06-04 17:19:56,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-04 17:19:56,588 INFO L175 Difference]: Start difference. First operand has 140 places, 238 transitions, 3259 flow. Second operand 6 states and 125 transitions. [2024-06-04 17:19:56,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 256 transitions, 3809 flow [2024-06-04 17:19:56,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 256 transitions, 3474 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 17:19:56,713 INFO L231 Difference]: Finished difference. Result has 139 places, 241 transitions, 3006 flow [2024-06-04 17:19:56,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2924, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3006, PETRI_PLACES=139, PETRI_TRANSITIONS=241} [2024-06-04 17:19:56,716 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 93 predicate places. [2024-06-04 17:19:56,716 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 241 transitions, 3006 flow [2024-06-04 17:19:56,716 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-04 17:19:56,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:56,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:56,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:19:56,720 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:19:56,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1417437790, now seen corresponding path program 4 times [2024-06-04 17:19:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:56,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905344632] [2024-06-04 17:19:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905344632] [2024-06-04 17:20:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905344632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:20:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026003787] [2024-06-04 17:20:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:12,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:20:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:20:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:20:13,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:20:13,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 241 transitions, 3006 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:20:13,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:13,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:20:13,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:15,032 INFO L124 PetriNetUnfolderBase]: 2701/4241 cut-off events. [2024-06-04 17:20:15,033 INFO L125 PetriNetUnfolderBase]: For 141541/141546 co-relation queries the response was YES. [2024-06-04 17:20:15,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27384 conditions, 4241 events. 2701/4241 cut-off events. For 141541/141546 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23011 event pairs, 586 based on Foata normal form. 8/4229 useless extension candidates. Maximal degree in co-relation 27319. Up to 3098 conditions per place. [2024-06-04 17:20:15,066 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 126 selfloop transitions, 145 changer transitions 0/278 dead transitions. [2024-06-04 17:20:15,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 278 transitions, 3884 flow [2024-06-04 17:20:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:20:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:20:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-04 17:20:15,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-04 17:20:15,069 INFO L175 Difference]: Start difference. First operand has 139 places, 241 transitions, 3006 flow. Second operand 8 states and 171 transitions. [2024-06-04 17:20:15,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 278 transitions, 3884 flow [2024-06-04 17:20:15,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 278 transitions, 3828 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 17:20:15,186 INFO L231 Difference]: Finished difference. Result has 143 places, 247 transitions, 3359 flow [2024-06-04 17:20:15,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2950, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3359, PETRI_PLACES=143, PETRI_TRANSITIONS=247} [2024-06-04 17:20:15,187 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 97 predicate places. [2024-06-04 17:20:15,187 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 247 transitions, 3359 flow [2024-06-04 17:20:15,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:20:15,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:15,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:15,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:20:15,188 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:20:15,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash 698569838, now seen corresponding path program 5 times [2024-06-04 17:20:15,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:15,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229704115] [2024-06-04 17:20:15,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:15,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:31,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229704115] [2024-06-04 17:20:31,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229704115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:31,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:20:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122900300] [2024-06-04 17:20:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:31,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:20:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:31,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:20:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:20:31,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:20:31,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 247 transitions, 3359 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:20:31,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:31,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:20:31,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:33,374 INFO L124 PetriNetUnfolderBase]: 2737/4305 cut-off events. [2024-06-04 17:20:33,375 INFO L125 PetriNetUnfolderBase]: For 153894/153899 co-relation queries the response was YES. [2024-06-04 17:20:33,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28732 conditions, 4305 events. 2737/4305 cut-off events. For 153894/153899 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 23514 event pairs, 591 based on Foata normal form. 8/4293 useless extension candidates. Maximal degree in co-relation 28666. Up to 3130 conditions per place. [2024-06-04 17:20:33,409 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 126 selfloop transitions, 150 changer transitions 0/283 dead transitions. [2024-06-04 17:20:33,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 283 transitions, 4253 flow [2024-06-04 17:20:33,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:20:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:20:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-04 17:20:33,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-04 17:20:33,412 INFO L175 Difference]: Start difference. First operand has 143 places, 247 transitions, 3359 flow. Second operand 8 states and 172 transitions. [2024-06-04 17:20:33,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 283 transitions, 4253 flow [2024-06-04 17:20:33,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 283 transitions, 3766 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-04 17:20:33,530 INFO L231 Difference]: Finished difference. Result has 144 places, 253 transitions, 3301 flow [2024-06-04 17:20:33,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3301, PETRI_PLACES=144, PETRI_TRANSITIONS=253} [2024-06-04 17:20:33,531 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 98 predicate places. [2024-06-04 17:20:33,531 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 253 transitions, 3301 flow [2024-06-04 17:20:33,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:20:33,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:33,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:33,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:20:33,531 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:20:33,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash 706844048, now seen corresponding path program 6 times [2024-06-04 17:20:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127209621] [2024-06-04 17:20:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:20:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127209621] [2024-06-04 17:20:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127209621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:20:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200149957] [2024-06-04 17:20:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:49,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:20:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:49,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:20:49,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:20:49,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:20:49,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 253 transitions, 3301 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:20:49,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:49,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:20:49,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:51,675 INFO L124 PetriNetUnfolderBase]: 2721/4284 cut-off events. [2024-06-04 17:20:51,675 INFO L125 PetriNetUnfolderBase]: For 155308/155313 co-relation queries the response was YES. [2024-06-04 17:20:51,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28425 conditions, 4284 events. 2721/4284 cut-off events. For 155308/155313 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23399 event pairs, 599 based on Foata normal form. 8/4272 useless extension candidates. Maximal degree in co-relation 28358. Up to 3117 conditions per place. [2024-06-04 17:20:51,708 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 108 selfloop transitions, 164 changer transitions 0/279 dead transitions. [2024-06-04 17:20:51,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 279 transitions, 3935 flow [2024-06-04 17:20:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:20:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:20:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-04 17:20:51,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-06-04 17:20:51,712 INFO L175 Difference]: Start difference. First operand has 144 places, 253 transitions, 3301 flow. Second operand 8 states and 167 transitions. [2024-06-04 17:20:51,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 279 transitions, 3935 flow [2024-06-04 17:20:51,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 279 transitions, 3611 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-04 17:20:51,841 INFO L231 Difference]: Finished difference. Result has 147 places, 253 transitions, 3316 flow [2024-06-04 17:20:51,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2977, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3316, PETRI_PLACES=147, PETRI_TRANSITIONS=253} [2024-06-04 17:20:51,842 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 101 predicate places. [2024-06-04 17:20:51,842 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 253 transitions, 3316 flow [2024-06-04 17:20:51,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:20:51,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:51,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:51,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:20:51,843 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-04 17:20:51,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 572757209, now seen corresponding path program 2 times [2024-06-04 17:20:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833022491] [2024-06-04 17:20:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:51,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:07,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833022491] [2024-06-04 17:21:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833022491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:07,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:07,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:21:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558552503] [2024-06-04 17:21:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:07,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:21:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:07,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:21:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:21:07,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:21:07,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 253 transitions, 3316 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-04 17:21:07,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:07,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:21:07,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:08,879 INFO L124 PetriNetUnfolderBase]: 2586/4143 cut-off events. [2024-06-04 17:21:08,880 INFO L125 PetriNetUnfolderBase]: For 161664/161683 co-relation queries the response was YES. [2024-06-04 17:21:08,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28012 conditions, 4143 events. 2586/4143 cut-off events. For 161664/161683 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 23242 event pairs, 705 based on Foata normal form. 15/4135 useless extension candidates. Maximal degree in co-relation 27944. Up to 3664 conditions per place. [2024-06-04 17:21:08,912 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 215 selfloop transitions, 23 changer transitions 0/266 dead transitions. [2024-06-04 17:21:08,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 266 transitions, 3876 flow [2024-06-04 17:21:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:21:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:21:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-04 17:21:08,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2024-06-04 17:21:08,914 INFO L175 Difference]: Start difference. First operand has 147 places, 253 transitions, 3316 flow. Second operand 6 states and 121 transitions. [2024-06-04 17:21:08,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 266 transitions, 3876 flow [2024-06-04 17:21:09,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 266 transitions, 3497 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:21:09,046 INFO L231 Difference]: Finished difference. Result has 145 places, 256 transitions, 3031 flow [2024-06-04 17:21:09,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2937, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3031, PETRI_PLACES=145, PETRI_TRANSITIONS=256} [2024-06-04 17:21:09,047 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 99 predicate places. [2024-06-04 17:21:09,047 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 256 transitions, 3031 flow [2024-06-04 17:21:09,047 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-04 17:21:09,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:09,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:09,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:21:09,048 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-04 17:21:09,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1137333611, now seen corresponding path program 1 times [2024-06-04 17:21:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:09,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180640566] [2024-06-04 17:21:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:24,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:24,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180640566] [2024-06-04 17:21:24,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180640566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:24,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:24,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:21:24,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738917063] [2024-06-04 17:21:24,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:24,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:21:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:24,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:21:24,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:21:24,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 17:21:24,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 256 transitions, 3031 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 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-04 17:21:24,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:24,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 17:21:24,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:25,875 INFO L124 PetriNetUnfolderBase]: 2369/3892 cut-off events. [2024-06-04 17:21:25,875 INFO L125 PetriNetUnfolderBase]: For 145709/145715 co-relation queries the response was YES. [2024-06-04 17:21:25,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25607 conditions, 3892 events. 2369/3892 cut-off events. For 145709/145715 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22251 event pairs, 686 based on Foata normal form. 5/3865 useless extension candidates. Maximal degree in co-relation 25538. Up to 3366 conditions per place. [2024-06-04 17:21:25,913 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 229 selfloop transitions, 12 changer transitions 0/270 dead transitions. [2024-06-04 17:21:25,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 270 transitions, 3577 flow [2024-06-04 17:21:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:21:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:21:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-06-04 17:21:25,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703703703703704 [2024-06-04 17:21:25,914 INFO L175 Difference]: Start difference. First operand has 145 places, 256 transitions, 3031 flow. Second operand 6 states and 127 transitions. [2024-06-04 17:21:25,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 270 transitions, 3577 flow [2024-06-04 17:21:26,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 270 transitions, 3505 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 17:21:26,150 INFO L231 Difference]: Finished difference. Result has 147 places, 259 transitions, 3027 flow [2024-06-04 17:21:26,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3027, PETRI_PLACES=147, PETRI_TRANSITIONS=259} [2024-06-04 17:21:26,151 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 101 predicate places. [2024-06-04 17:21:26,151 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 259 transitions, 3027 flow [2024-06-04 17:21:26,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 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-04 17:21:26,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:26,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:26,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:21:26,152 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-04 17:21:26,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash 565353851, now seen corresponding path program 2 times [2024-06-04 17:21:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518815964] [2024-06-04 17:21:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:42,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:42,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518815964] [2024-06-04 17:21:42,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518815964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:42,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:42,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:21:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127640509] [2024-06-04 17:21:42,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:42,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:21:42,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:42,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:21:42,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:21:42,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2024-06-04 17:21:42,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 259 transitions, 3027 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 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-04 17:21:42,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:42,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2024-06-04 17:21:42,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:43,811 INFO L124 PetriNetUnfolderBase]: 2366/3889 cut-off events. [2024-06-04 17:21:43,811 INFO L125 PetriNetUnfolderBase]: For 152549/152558 co-relation queries the response was YES. [2024-06-04 17:21:43,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26037 conditions, 3889 events. 2366/3889 cut-off events. For 152549/152558 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 22248 event pairs, 690 based on Foata normal form. 7/3863 useless extension candidates. Maximal degree in co-relation 25967. Up to 3356 conditions per place. [2024-06-04 17:21:43,845 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 224 selfloop transitions, 17 changer transitions 0/270 dead transitions. [2024-06-04 17:21:43,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 270 transitions, 3569 flow [2024-06-04 17:21:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:21:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:21:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-04 17:21:43,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-04 17:21:43,846 INFO L175 Difference]: Start difference. First operand has 147 places, 259 transitions, 3027 flow. Second operand 6 states and 126 transitions. [2024-06-04 17:21:43,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 270 transitions, 3569 flow [2024-06-04 17:21:43,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 270 transitions, 3523 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-04 17:21:43,973 INFO L231 Difference]: Finished difference. Result has 149 places, 262 transitions, 3065 flow [2024-06-04 17:21:43,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2981, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3065, PETRI_PLACES=149, PETRI_TRANSITIONS=262} [2024-06-04 17:21:43,973 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 103 predicate places. [2024-06-04 17:21:43,973 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 262 transitions, 3065 flow [2024-06-04 17:21:43,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 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-04 17:21:43,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:43,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:43,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:21:43,974 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:21:43,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash 707151878, now seen corresponding path program 1 times [2024-06-04 17:21:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968351330] [2024-06-04 17:21:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:21:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:59,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968351330] [2024-06-04 17:21:59,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968351330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:59,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:59,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856324218] [2024-06-04 17:21:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:59,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:59,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:21:59,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 262 transitions, 3065 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:21:59,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:59,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:21:59,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:01,314 INFO L124 PetriNetUnfolderBase]: 2469/4003 cut-off events. [2024-06-04 17:22:01,314 INFO L125 PetriNetUnfolderBase]: For 159077/159079 co-relation queries the response was YES. [2024-06-04 17:22:01,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26897 conditions, 4003 events. 2469/4003 cut-off events. For 159077/159079 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 22410 event pairs, 669 based on Foata normal form. 4/4004 useless extension candidates. Maximal degree in co-relation 26826. Up to 3544 conditions per place. [2024-06-04 17:22:01,347 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 266 selfloop transitions, 20 changer transitions 0/294 dead transitions. [2024-06-04 17:22:01,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 294 transitions, 3779 flow [2024-06-04 17:22:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2024-06-04 17:22:01,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-06-04 17:22:01,350 INFO L175 Difference]: Start difference. First operand has 149 places, 262 transitions, 3065 flow. Second operand 9 states and 183 transitions. [2024-06-04 17:22:01,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 294 transitions, 3779 flow [2024-06-04 17:22:01,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 294 transitions, 3717 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-04 17:22:01,459 INFO L231 Difference]: Finished difference. Result has 155 places, 267 transitions, 3122 flow [2024-06-04 17:22:01,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3003, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3122, PETRI_PLACES=155, PETRI_TRANSITIONS=267} [2024-06-04 17:22:01,460 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 109 predicate places. [2024-06-04 17:22:01,460 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 267 transitions, 3122 flow [2024-06-04 17:22:01,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:01,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:01,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:01,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:22:01,461 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-04 17:22:01,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:01,461 INFO L85 PathProgramCache]: Analyzing trace with hash 572773081, now seen corresponding path program 1 times [2024-06-04 17:22:01,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:01,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959767273] [2024-06-04 17:22:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:01,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:17,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:17,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959767273] [2024-06-04 17:22:17,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959767273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:17,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:17,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:22:17,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045019890] [2024-06-04 17:22:17,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:17,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:22:17,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:17,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:22:17,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:22:17,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:22:17,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 267 transitions, 3122 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:17,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:17,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:22:17,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:18,916 INFO L124 PetriNetUnfolderBase]: 2490/4005 cut-off events. [2024-06-04 17:22:18,916 INFO L125 PetriNetUnfolderBase]: For 165923/165929 co-relation queries the response was YES. [2024-06-04 17:22:18,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27558 conditions, 4005 events. 2490/4005 cut-off events. For 165923/165929 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 22334 event pairs, 699 based on Foata normal form. 5/3978 useless extension candidates. Maximal degree in co-relation 27485. Up to 3588 conditions per place. [2024-06-04 17:22:18,952 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 237 selfloop transitions, 15 changer transitions 0/279 dead transitions. [2024-06-04 17:22:18,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 279 transitions, 3690 flow [2024-06-04 17:22:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:22:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:22:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-04 17:22:18,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:22:18,953 INFO L175 Difference]: Start difference. First operand has 155 places, 267 transitions, 3122 flow. Second operand 7 states and 135 transitions. [2024-06-04 17:22:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 279 transitions, 3690 flow [2024-06-04 17:22:19,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 279 transitions, 3619 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:22:19,127 INFO L231 Difference]: Finished difference. Result has 156 places, 270 transitions, 3133 flow [2024-06-04 17:22:19,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3051, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3133, PETRI_PLACES=156, PETRI_TRANSITIONS=270} [2024-06-04 17:22:19,128 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 110 predicate places. [2024-06-04 17:22:19,128 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 270 transitions, 3133 flow [2024-06-04 17:22:19,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:22:19,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:19,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:19,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:22:19,129 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:22:19,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1540466906, now seen corresponding path program 1 times [2024-06-04 17:22:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207320296] [2024-06-04 17:22:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207320296] [2024-06-04 17:22:35,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207320296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:35,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:22:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456830386] [2024-06-04 17:22:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:35,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:22:35,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:22:35,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:22:35,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:22:35,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 270 transitions, 3133 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:22:35,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:35,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:22:35,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:37,538 INFO L124 PetriNetUnfolderBase]: 2727/4287 cut-off events. [2024-06-04 17:22:37,538 INFO L125 PetriNetUnfolderBase]: For 202003/202008 co-relation queries the response was YES. [2024-06-04 17:22:37,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30541 conditions, 4287 events. 2727/4287 cut-off events. For 202003/202008 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23370 event pairs, 679 based on Foata normal form. 4/4287 useless extension candidates. Maximal degree in co-relation 30467. Up to 3596 conditions per place. [2024-06-04 17:22:37,577 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 184 selfloop transitions, 108 changer transitions 0/299 dead transitions. [2024-06-04 17:22:37,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 299 transitions, 3841 flow [2024-06-04 17:22:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:22:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:22:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-04 17:22:37,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-06-04 17:22:37,581 INFO L175 Difference]: Start difference. First operand has 156 places, 270 transitions, 3133 flow. Second operand 8 states and 167 transitions. [2024-06-04 17:22:37,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 299 transitions, 3841 flow [2024-06-04 17:22:37,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 299 transitions, 3781 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 17:22:37,813 INFO L231 Difference]: Finished difference. Result has 159 places, 272 transitions, 3333 flow [2024-06-04 17:22:37,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3073, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3333, PETRI_PLACES=159, PETRI_TRANSITIONS=272} [2024-06-04 17:22:37,813 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places. [2024-06-04 17:22:37,813 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 272 transitions, 3333 flow [2024-06-04 17:22:37,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:22:37,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:37,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:37,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:22:37,814 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:22:37,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:37,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1455746144, now seen corresponding path program 2 times [2024-06-04 17:22:37,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:37,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703115454] [2024-06-04 17:22:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:22:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703115454] [2024-06-04 17:22:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703115454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:54,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:22:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522516834] [2024-06-04 17:22:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:54,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:22:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:22:54,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:22:54,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:22:54,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 272 transitions, 3333 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:22:54,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:54,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:22:54,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:56,659 INFO L124 PetriNetUnfolderBase]: 2744/4316 cut-off events. [2024-06-04 17:22:56,660 INFO L125 PetriNetUnfolderBase]: For 213711/213716 co-relation queries the response was YES. [2024-06-04 17:22:56,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31450 conditions, 4316 events. 2744/4316 cut-off events. For 213711/213716 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23530 event pairs, 683 based on Foata normal form. 4/4316 useless extension candidates. Maximal degree in co-relation 31375. Up to 3571 conditions per place. [2024-06-04 17:22:56,695 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 185 selfloop transitions, 109 changer transitions 0/301 dead transitions. [2024-06-04 17:22:56,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 301 transitions, 4041 flow [2024-06-04 17:22:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:22:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:22:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-06-04 17:22:56,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-04 17:22:56,698 INFO L175 Difference]: Start difference. First operand has 159 places, 272 transitions, 3333 flow. Second operand 8 states and 168 transitions. [2024-06-04 17:22:56,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 301 transitions, 4041 flow [2024-06-04 17:22:56,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 301 transitions, 3805 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:22:56,831 INFO L231 Difference]: Finished difference. Result has 161 places, 274 transitions, 3360 flow [2024-06-04 17:22:56,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3097, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3360, PETRI_PLACES=161, PETRI_TRANSITIONS=274} [2024-06-04 17:22:56,832 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 115 predicate places. [2024-06-04 17:22:56,832 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 274 transitions, 3360 flow [2024-06-04 17:22:56,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:22:56,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:56,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:56,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:22:56,833 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:22:56,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1451753276, now seen corresponding path program 3 times [2024-06-04 17:22:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:56,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26273291] [2024-06-04 17:22:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:13,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:13,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26273291] [2024-06-04 17:23:13,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26273291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:13,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:13,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:23:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638365366] [2024-06-04 17:23:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:13,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:23:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:13,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:23:13,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:23:14,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:23:14,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 274 transitions, 3360 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:23:14,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:14,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:23:14,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:16,168 INFO L124 PetriNetUnfolderBase]: 2761/4355 cut-off events. [2024-06-04 17:23:16,168 INFO L125 PetriNetUnfolderBase]: For 224496/224501 co-relation queries the response was YES. [2024-06-04 17:23:16,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31995 conditions, 4355 events. 2761/4355 cut-off events. For 224496/224501 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23878 event pairs, 559 based on Foata normal form. 4/4355 useless extension candidates. Maximal degree in co-relation 31919. Up to 3403 conditions per place. [2024-06-04 17:23:16,207 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 200 selfloop transitions, 100 changer transitions 0/307 dead transitions. [2024-06-04 17:23:16,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 307 transitions, 4260 flow [2024-06-04 17:23:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:23:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:23:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-04 17:23:16,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-06-04 17:23:16,211 INFO L175 Difference]: Start difference. First operand has 161 places, 274 transitions, 3360 flow. Second operand 8 states and 169 transitions. [2024-06-04 17:23:16,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 307 transitions, 4260 flow [2024-06-04 17:23:16,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 307 transitions, 4015 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 17:23:16,338 INFO L231 Difference]: Finished difference. Result has 163 places, 278 transitions, 3402 flow [2024-06-04 17:23:16,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3115, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3402, PETRI_PLACES=163, PETRI_TRANSITIONS=278} [2024-06-04 17:23:16,339 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 117 predicate places. [2024-06-04 17:23:16,339 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 278 transitions, 3402 flow [2024-06-04 17:23:16,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:23:16,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:16,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:16,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:23:16,339 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:23:16,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2118280126, now seen corresponding path program 4 times [2024-06-04 17:23:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:16,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074305105] [2024-06-04 17:23:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:33,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:33,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074305105] [2024-06-04 17:23:33,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074305105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:33,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:33,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:23:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273648111] [2024-06-04 17:23:33,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:33,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:23:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:33,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:23:33,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:23:33,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:23:33,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 278 transitions, 3402 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:23:33,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:33,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:23:33,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:35,477 INFO L124 PetriNetUnfolderBase]: 2778/4388 cut-off events. [2024-06-04 17:23:35,477 INFO L125 PetriNetUnfolderBase]: For 234892/234899 co-relation queries the response was YES. [2024-06-04 17:23:35,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32502 conditions, 4388 events. 2778/4388 cut-off events. For 234892/234899 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 24113 event pairs, 521 based on Foata normal form. 8/4392 useless extension candidates. Maximal degree in co-relation 32425. Up to 3544 conditions per place. [2024-06-04 17:23:35,524 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 188 selfloop transitions, 117 changer transitions 0/312 dead transitions. [2024-06-04 17:23:35,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 312 transitions, 4312 flow [2024-06-04 17:23:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:23:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:23:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-04 17:23:35,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-04 17:23:35,527 INFO L175 Difference]: Start difference. First operand has 163 places, 278 transitions, 3402 flow. Second operand 8 states and 174 transitions. [2024-06-04 17:23:35,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 312 transitions, 4312 flow [2024-06-04 17:23:35,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 312 transitions, 4167 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-04 17:23:35,711 INFO L231 Difference]: Finished difference. Result has 167 places, 280 transitions, 3540 flow [2024-06-04 17:23:35,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3265, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3540, PETRI_PLACES=167, PETRI_TRANSITIONS=280} [2024-06-04 17:23:35,712 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 121 predicate places. [2024-06-04 17:23:35,712 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 280 transitions, 3540 flow [2024-06-04 17:23:35,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:23:35,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:35,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:35,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:23:35,713 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:23:35,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2123790376, now seen corresponding path program 5 times [2024-06-04 17:23:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452854932] [2024-06-04 17:23:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:23:52,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:52,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452854932] [2024-06-04 17:23:52,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452854932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:52,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:52,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:23:52,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465324359] [2024-06-04 17:23:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:52,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:23:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:23:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:23:52,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:23:52,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 280 transitions, 3540 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:23:52,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:52,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:23:52,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:54,656 INFO L124 PetriNetUnfolderBase]: 2795/4404 cut-off events. [2024-06-04 17:23:54,656 INFO L125 PetriNetUnfolderBase]: For 246663/246668 co-relation queries the response was YES. [2024-06-04 17:23:54,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33241 conditions, 4404 events. 2795/4404 cut-off events. For 246663/246668 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 24191 event pairs, 685 based on Foata normal form. 4/4404 useless extension candidates. Maximal degree in co-relation 33162. Up to 3704 conditions per place. [2024-06-04 17:23:54,698 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 200 selfloop transitions, 102 changer transitions 0/309 dead transitions. [2024-06-04 17:23:54,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 309 transitions, 4276 flow [2024-06-04 17:23:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:23:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:23:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-04 17:23:54,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-06-04 17:23:54,701 INFO L175 Difference]: Start difference. First operand has 167 places, 280 transitions, 3540 flow. Second operand 8 states and 166 transitions. [2024-06-04 17:23:54,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 309 transitions, 4276 flow [2024-06-04 17:23:54,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 309 transitions, 4001 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:23:54,888 INFO L231 Difference]: Finished difference. Result has 169 places, 282 transitions, 3521 flow [2024-06-04 17:23:54,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3269, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3521, PETRI_PLACES=169, PETRI_TRANSITIONS=282} [2024-06-04 17:23:54,889 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 123 predicate places. [2024-06-04 17:23:54,889 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 282 transitions, 3521 flow [2024-06-04 17:23:54,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:23:54,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:54,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:23:54,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:23:54,891 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:23:54,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2118283846, now seen corresponding path program 6 times [2024-06-04 17:23:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518916932] [2024-06-04 17:23:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:54,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518916932] [2024-06-04 17:24:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518916932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:24:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338703877] [2024-06-04 17:24:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:11,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:24:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:11,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:24:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:24:11,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:24:11,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 282 transitions, 3521 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:24:11,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:11,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:24:11,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:13,518 INFO L124 PetriNetUnfolderBase]: 2812/4437 cut-off events. [2024-06-04 17:24:13,518 INFO L125 PetriNetUnfolderBase]: For 257226/257233 co-relation queries the response was YES. [2024-06-04 17:24:13,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33539 conditions, 4437 events. 2812/4437 cut-off events. For 257226/257233 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 24476 event pairs, 685 based on Foata normal form. 8/4441 useless extension candidates. Maximal degree in co-relation 33459. Up to 3731 conditions per place. [2024-06-04 17:24:13,566 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 192 selfloop transitions, 115 changer transitions 0/314 dead transitions. [2024-06-04 17:24:13,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 314 transitions, 4289 flow [2024-06-04 17:24:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:24:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:24:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-06-04 17:24:13,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-04 17:24:13,570 INFO L175 Difference]: Start difference. First operand has 169 places, 282 transitions, 3521 flow. Second operand 8 states and 170 transitions. [2024-06-04 17:24:13,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 314 transitions, 4289 flow [2024-06-04 17:24:13,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 314 transitions, 4065 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:24:13,771 INFO L231 Difference]: Finished difference. Result has 171 places, 284 transitions, 3579 flow [2024-06-04 17:24:13,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3579, PETRI_PLACES=171, PETRI_TRANSITIONS=284} [2024-06-04 17:24:13,772 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 125 predicate places. [2024-06-04 17:24:13,772 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 284 transitions, 3579 flow [2024-06-04 17:24:13,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:24:13,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:13,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:13,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:24:13,772 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-04 17:24:13,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash 528433295, now seen corresponding path program 1 times [2024-06-04 17:24:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:13,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716988907] [2024-06-04 17:24:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:30,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:30,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716988907] [2024-06-04 17:24:30,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716988907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:30,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:30,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:24:30,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273648310] [2024-06-04 17:24:30,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:30,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:24:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:30,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:24:30,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:24:30,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:24:30,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 284 transitions, 3579 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:30,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:30,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:24:30,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:32,454 INFO L124 PetriNetUnfolderBase]: 2679/4304 cut-off events. [2024-06-04 17:24:32,454 INFO L125 PetriNetUnfolderBase]: For 267309/267317 co-relation queries the response was YES. [2024-06-04 17:24:32,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32963 conditions, 4304 events. 2679/4304 cut-off events. For 267309/267317 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24403 event pairs, 672 based on Foata normal form. 9/4306 useless extension candidates. Maximal degree in co-relation 32882. Up to 3608 conditions per place. [2024-06-04 17:24:32,499 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 217 selfloop transitions, 58 changer transitions 0/310 dead transitions. [2024-06-04 17:24:32,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 310 transitions, 4275 flow [2024-06-04 17:24:32,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:24:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:24:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-06-04 17:24:32,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-04 17:24:32,500 INFO L175 Difference]: Start difference. First operand has 171 places, 284 transitions, 3579 flow. Second operand 7 states and 152 transitions. [2024-06-04 17:24:32,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 310 transitions, 4275 flow [2024-06-04 17:24:32,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 310 transitions, 4021 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 17:24:32,716 INFO L231 Difference]: Finished difference. Result has 172 places, 288 transitions, 3514 flow [2024-06-04 17:24:32,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3325, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3514, PETRI_PLACES=172, PETRI_TRANSITIONS=288} [2024-06-04 17:24:32,716 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 126 predicate places. [2024-06-04 17:24:32,717 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 288 transitions, 3514 flow [2024-06-04 17:24:32,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:32,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:32,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:32,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:24:32,717 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-04 17:24:32,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash 528791779, now seen corresponding path program 1 times [2024-06-04 17:24:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:32,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467283563] [2024-06-04 17:24:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:32,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:24:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:24:49,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:24:49,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467283563] [2024-06-04 17:24:49,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467283563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:24:49,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:24:49,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:24:49,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937747945] [2024-06-04 17:24:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:24:49,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:24:49,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:24:49,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:24:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:24:49,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:24:49,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 288 transitions, 3514 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:49,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:24:49,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:24:49,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:24:51,433 INFO L124 PetriNetUnfolderBase]: 2826/4440 cut-off events. [2024-06-04 17:24:51,433 INFO L125 PetriNetUnfolderBase]: For 277684/277700 co-relation queries the response was YES. [2024-06-04 17:24:51,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34097 conditions, 4440 events. 2826/4440 cut-off events. For 277684/277700 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 24490 event pairs, 756 based on Foata normal form. 15/4427 useless extension candidates. Maximal degree in co-relation 34015. Up to 4021 conditions per place. [2024-06-04 17:24:51,479 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 252 selfloop transitions, 22 changer transitions 0/307 dead transitions. [2024-06-04 17:24:51,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 307 transitions, 4170 flow [2024-06-04 17:24:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:24:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:24:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-04 17:24:51,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:24:51,480 INFO L175 Difference]: Start difference. First operand has 172 places, 288 transitions, 3514 flow. Second operand 7 states and 135 transitions. [2024-06-04 17:24:51,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 307 transitions, 4170 flow [2024-06-04 17:24:51,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 307 transitions, 4017 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-04 17:24:51,700 INFO L231 Difference]: Finished difference. Result has 174 places, 291 transitions, 3459 flow [2024-06-04 17:24:51,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3361, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3459, PETRI_PLACES=174, PETRI_TRANSITIONS=291} [2024-06-04 17:24:51,700 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 128 predicate places. [2024-06-04 17:24:51,701 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 291 transitions, 3459 flow [2024-06-04 17:24:51,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:24:51,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:24:51,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:24:51,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:24:51,701 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-04 17:24:51,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:24:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash 528791345, now seen corresponding path program 2 times [2024-06-04 17:24:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:24:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271206585] [2024-06-04 17:24:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:24:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:24:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:25:08,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271206585] [2024-06-04 17:25:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271206585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:08,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:08,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:25:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133317025] [2024-06-04 17:25:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:08,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:25:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:25:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:25:08,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:25:08,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 291 transitions, 3459 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:08,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:08,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:25:08,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:10,344 INFO L124 PetriNetUnfolderBase]: 2729/4368 cut-off events. [2024-06-04 17:25:10,345 INFO L125 PetriNetUnfolderBase]: For 291323/291329 co-relation queries the response was YES. [2024-06-04 17:25:10,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34368 conditions, 4368 events. 2729/4368 cut-off events. For 291323/291329 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24637 event pairs, 689 based on Foata normal form. 5/4366 useless extension candidates. Maximal degree in co-relation 34285. Up to 3624 conditions per place. [2024-06-04 17:25:10,385 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 227 selfloop transitions, 52 changer transitions 0/315 dead transitions. [2024-06-04 17:25:10,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 315 transitions, 4281 flow [2024-06-04 17:25:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:25:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:25:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-04 17:25:10,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46984126984126984 [2024-06-04 17:25:10,391 INFO L175 Difference]: Start difference. First operand has 174 places, 291 transitions, 3459 flow. Second operand 7 states and 148 transitions. [2024-06-04 17:25:10,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 315 transitions, 4281 flow [2024-06-04 17:25:10,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 315 transitions, 4205 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-04 17:25:10,588 INFO L231 Difference]: Finished difference. Result has 177 places, 299 transitions, 3651 flow [2024-06-04 17:25:10,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3383, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3651, PETRI_PLACES=177, PETRI_TRANSITIONS=299} [2024-06-04 17:25:10,588 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places. [2024-06-04 17:25:10,589 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 299 transitions, 3651 flow [2024-06-04 17:25:10,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:10,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:10,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:10,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:25:10,589 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:25:10,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 180622188, now seen corresponding path program 7 times [2024-06-04 17:25:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:10,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719778583] [2024-06-04 17:25:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:25:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719778583] [2024-06-04 17:25:26,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719778583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:26,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:25:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954240853] [2024-06-04 17:25:26,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:26,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:25:26,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:25:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:25:27,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:25:27,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 299 transitions, 3651 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:25:27,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:27,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:25:27,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:29,319 INFO L124 PetriNetUnfolderBase]: 2863/4502 cut-off events. [2024-06-04 17:25:29,319 INFO L125 PetriNetUnfolderBase]: For 305625/305630 co-relation queries the response was YES. [2024-06-04 17:25:29,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36051 conditions, 4502 events. 2863/4502 cut-off events. For 305625/305630 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 24799 event pairs, 710 based on Foata normal form. 6/4488 useless extension candidates. Maximal degree in co-relation 35966. Up to 3798 conditions per place. [2024-06-04 17:25:29,363 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 219 selfloop transitions, 96 changer transitions 0/323 dead transitions. [2024-06-04 17:25:29,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 323 transitions, 4371 flow [2024-06-04 17:25:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:25:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:25:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-04 17:25:29,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-04 17:25:29,367 INFO L175 Difference]: Start difference. First operand has 177 places, 299 transitions, 3651 flow. Second operand 8 states and 162 transitions. [2024-06-04 17:25:29,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 323 transitions, 4371 flow [2024-06-04 17:25:29,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 323 transitions, 4238 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-04 17:25:29,658 INFO L231 Difference]: Finished difference. Result has 182 places, 299 transitions, 3719 flow [2024-06-04 17:25:29,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3518, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3719, PETRI_PLACES=182, PETRI_TRANSITIONS=299} [2024-06-04 17:25:29,659 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-06-04 17:25:29,659 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 299 transitions, 3719 flow [2024-06-04 17:25:29,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-04 17:25:29,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:29,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:29,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:25:29,659 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-04 17:25:29,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash 573702099, now seen corresponding path program 2 times [2024-06-04 17:25:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191329005] [2024-06-04 17:25:29,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:25:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:25:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:25:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191329005] [2024-06-04 17:25:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191329005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:25:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:25:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:25:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24769308] [2024-06-04 17:25:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:25:46,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:25:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:25:46,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:25:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:25:46,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:25:46,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 299 transitions, 3719 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:46,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:25:46,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:25:46,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:25:47,957 INFO L124 PetriNetUnfolderBase]: 2842/4478 cut-off events. [2024-06-04 17:25:47,957 INFO L125 PetriNetUnfolderBase]: For 314402/314421 co-relation queries the response was YES. [2024-06-04 17:25:47,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36170 conditions, 4478 events. 2842/4478 cut-off events. For 314402/314421 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 24882 event pairs, 734 based on Foata normal form. 15/4470 useless extension candidates. Maximal degree in co-relation 36083. Up to 4034 conditions per place. [2024-06-04 17:25:47,999 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 250 selfloop transitions, 34 changer transitions 0/317 dead transitions. [2024-06-04 17:25:47,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 317 transitions, 4537 flow [2024-06-04 17:25:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:25:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:25:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 17:25:48,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-04 17:25:48,006 INFO L175 Difference]: Start difference. First operand has 182 places, 299 transitions, 3719 flow. Second operand 7 states and 133 transitions. [2024-06-04 17:25:48,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 317 transitions, 4537 flow [2024-06-04 17:25:48,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 317 transitions, 4314 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:25:48,231 INFO L231 Difference]: Finished difference. Result has 182 places, 305 transitions, 3680 flow [2024-06-04 17:25:48,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3496, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3680, PETRI_PLACES=182, PETRI_TRANSITIONS=305} [2024-06-04 17:25:48,232 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 136 predicate places. [2024-06-04 17:25:48,232 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 305 transitions, 3680 flow [2024-06-04 17:25:48,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:25:48,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:25:48,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:25:48,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:25:48,233 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-04 17:25:48,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:25:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash 575605453, now seen corresponding path program 3 times [2024-06-04 17:25:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:25:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382802446] [2024-06-04 17:25:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:25:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:25:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:04,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382802446] [2024-06-04 17:26:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382802446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:26:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406370372] [2024-06-04 17:26:04,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:04,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:26:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:26:04,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:26:04,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45 [2024-06-04 17:26:04,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 305 transitions, 3680 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:04,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:04,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45 [2024-06-04 17:26:04,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:06,394 INFO L124 PetriNetUnfolderBase]: 2839/4474 cut-off events. [2024-06-04 17:26:06,394 INFO L125 PetriNetUnfolderBase]: For 326874/326893 co-relation queries the response was YES. [2024-06-04 17:26:06,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36300 conditions, 4474 events. 2839/4474 cut-off events. For 326874/326893 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 24868 event pairs, 734 based on Foata normal form. 15/4466 useless extension candidates. Maximal degree in co-relation 36212. Up to 4031 conditions per place. [2024-06-04 17:26:06,440 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 250 selfloop transitions, 33 changer transitions 0/316 dead transitions. [2024-06-04 17:26:06,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 316 transitions, 4296 flow [2024-06-04 17:26:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:26:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:26:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 17:26:06,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-04 17:26:06,441 INFO L175 Difference]: Start difference. First operand has 182 places, 305 transitions, 3680 flow. Second operand 7 states and 133 transitions. [2024-06-04 17:26:06,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 316 transitions, 4296 flow [2024-06-04 17:26:06,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 316 transitions, 4187 flow, removed 41 selfloop flow, removed 3 redundant places. [2024-06-04 17:26:06,803 INFO L231 Difference]: Finished difference. Result has 186 places, 305 transitions, 3643 flow [2024-06-04 17:26:06,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3571, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3643, PETRI_PLACES=186, PETRI_TRANSITIONS=305} [2024-06-04 17:26:06,803 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 140 predicate places. [2024-06-04 17:26:06,803 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 305 transitions, 3643 flow [2024-06-04 17:26:06,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:06,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:06,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:06,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:26:06,804 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-04 17:26:06,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 573226435, now seen corresponding path program 3 times [2024-06-04 17:26:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411315150] [2024-06-04 17:26:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:26:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:26:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:26:24,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411315150] [2024-06-04 17:26:24,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411315150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:26:24,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:26:24,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:26:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767745063] [2024-06-04 17:26:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:26:24,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:26:24,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:26:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:26:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:26:24,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2024-06-04 17:26:24,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 305 transitions, 3643 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:24,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:26:24,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2024-06-04 17:26:24,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:26:26,018 INFO L124 PetriNetUnfolderBase]: 2727/4370 cut-off events. [2024-06-04 17:26:26,019 INFO L125 PetriNetUnfolderBase]: For 338293/338299 co-relation queries the response was YES. [2024-06-04 17:26:26,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36072 conditions, 4370 events. 2727/4370 cut-off events. For 338293/338299 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 24748 event pairs, 708 based on Foata normal form. 5/4352 useless extension candidates. Maximal degree in co-relation 35982. Up to 3593 conditions per place. [2024-06-04 17:26:26,071 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 223 selfloop transitions, 64 changer transitions 0/325 dead transitions. [2024-06-04 17:26:26,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 325 transitions, 4593 flow [2024-06-04 17:26:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:26:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:26:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-04 17:26:26,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-04 17:26:26,073 INFO L175 Difference]: Start difference. First operand has 186 places, 305 transitions, 3643 flow. Second operand 7 states and 146 transitions. [2024-06-04 17:26:26,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 325 transitions, 4593 flow [2024-06-04 17:26:26,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 325 transitions, 4509 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:26:26,456 INFO L231 Difference]: Finished difference. Result has 188 places, 313 transitions, 3857 flow [2024-06-04 17:26:26,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=3559, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3857, PETRI_PLACES=188, PETRI_TRANSITIONS=313} [2024-06-04 17:26:26,457 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 142 predicate places. [2024-06-04 17:26:26,457 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 313 transitions, 3857 flow [2024-06-04 17:26:26,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:26:26,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:26:26,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:26:26,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:26:26,457 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-04 17:26:26,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:26:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1724483891, now seen corresponding path program 1 times [2024-06-04 17:26:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:26:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715295118] [2024-06-04 17:26:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:26:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:26:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15