./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.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/mix015.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/mix015.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix015.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 14:37:18,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:37:18,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:37:18,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:37:18,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:37:18,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:37:18,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:37:18,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:37:18,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:37:18,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:37:18,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:37:18,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:37:18,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:37:18,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:37:18,133 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:37:18,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:37:18,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:37:18,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:37:18,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:37:18,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:37:18,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:37:18,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:37:18,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:37:18,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:37:18,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:37:18,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:37:18,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:37:18,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:37:18,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:37:18,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:37:18,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:37:18,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:37:18,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:37:18,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:37:18,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:37:18,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:37:18,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:37:18,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:37:18,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:37:18,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:37:18,142 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:37:18,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:37:18,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:37:18,143 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-14 14:37:18,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:37:18,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:37:18,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:37:18,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:37:18,347 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:37:18,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2024-06-14 14:37:19,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:37:19,560 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:37:19,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2024-06-14 14:37:19,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3df3dd5/0a1644028d634d5b810d12dbc6585cdb/FLAG706693b35 [2024-06-14 14:37:19,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3df3dd5/0a1644028d634d5b810d12dbc6585cdb [2024-06-14 14:37:19,583 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:37:19,586 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:37:19,586 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/mix015.oepc.yml/witness.yml [2024-06-14 14:37:19,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:37:19,778 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:37:19,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:37:19,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:37:19,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:37:19,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:37:19" (1/2) ... [2024-06-14 14:37:19,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77688d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:19, skipping insertion in model container [2024-06-14 14:37:19,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:37:19" (1/2) ... [2024-06-14 14:37:19,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@fc7139a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:19, skipping insertion in model container [2024-06-14 14:37:19,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:37:19" (2/2) ... [2024-06-14 14:37:19,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77688d7f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:19, skipping insertion in model container [2024-06-14 14:37:19,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:37:19" (2/2) ... [2024-06-14 14:37:19,787 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:37:19,867 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:37:19,869 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] ((((((((((((((((((((((! multithreaded || a$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (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 )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 )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0) [2024-06-14 14:37:19,869 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] ((((((((((((((((((((((! multithreaded || a$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (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 )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 )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0) [2024-06-14 14:37:19,870 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((! multithreaded || a$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 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 )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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (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 )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 )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0) [2024-06-14 14:37:19,871 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:37:19,871 INFO L106 edCorrectnessWitness]: ghost_update [L851-L851] multithreaded = 1; [2024-06-14 14:37:19,911 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:37:20,242 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:37:20,253 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:37:20,597 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:37:20,657 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:37:20,658 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20 WrapperNode [2024-06-14 14:37:20,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:37:20,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:37:20,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:37:20,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:37:20,664 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 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:20,706 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 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:20,858 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2024-06-14 14:37:20,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:37:20,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:37:20,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:37:20,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:37:20,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:20,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:20,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:20,949 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-14 14:37:20,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:20,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:20,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:20,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:21,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:21,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:21,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:37:21,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:37:21,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:37:21,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:37:21,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (1/1) ... [2024-06-14 14:37:21,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:37:21,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:37:21,054 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-14 14:37:21,073 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-14 14:37:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:37:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:37:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:37:21,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:37:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:37:21,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:37:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 14:37:21,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 14:37:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:37:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:37:21,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:37:21,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:37:21,088 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:37:21,279 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:37:21,281 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:37:22,748 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:37:22,749 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:37:23,066 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:37:23,066 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:37:23,067 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:37:23 BoogieIcfgContainer [2024-06-14 14:37:23,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:37:23,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:37:23,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:37:23,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:37:23,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:37:19" (1/4) ... [2024-06-14 14:37:23,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2572d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:37:23, skipping insertion in model container [2024-06-14 14:37:23,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:37:19" (2/4) ... [2024-06-14 14:37:23,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2572d6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:37:23, skipping insertion in model container [2024-06-14 14:37:23,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:20" (3/4) ... [2024-06-14 14:37:23,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2572d6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:37:23, skipping insertion in model container [2024-06-14 14:37:23,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:37:23" (4/4) ... [2024-06-14 14:37:23,074 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2024-06-14 14:37:23,088 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:37:23,088 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 14:37:23,089 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:37:23,195 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:37:23,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow [2024-06-14 14:37:23,315 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-06-14 14:37:23,315 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:37:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:37:23,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow [2024-06-14 14:37:23,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow [2024-06-14 14:37:23,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:37:23,364 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;@27c6b27b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:37:23,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 14:37:23,373 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:37:23,381 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 14:37:23,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:37:23,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:23,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:37:23,383 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-14 14:37:23,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1071780369, now seen corresponding path program 1 times [2024-06-14 14:37:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519662675] [2024-06-14 14:37:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:32,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519662675] [2024-06-14 14:37:32,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519662675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:32,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:32,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:37:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381486626] [2024-06-14 14:37:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:32,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:37:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:37:32,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:37:32,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-14 14:37:32,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:32,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:32,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-14 14:37:32,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:33,352 INFO L124 PetriNetUnfolderBase]: 1363/2134 cut-off events. [2024-06-14 14:37:33,353 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-14 14:37:33,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 2134 events. 1363/2134 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10802 event pairs, 964 based on Foata normal form. 1/2097 useless extension candidates. Maximal degree in co-relation 4245. Up to 2037 conditions per place. [2024-06-14 14:37:33,370 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-14 14:37:33,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 181 flow [2024-06-14 14:37:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:37:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:37:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-14 14:37:33,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-06-14 14:37:33,380 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 80 transitions. [2024-06-14 14:37:33,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 181 flow [2024-06-14 14:37:33,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 14:37:33,388 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow [2024-06-14 14:37:33,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-14 14:37:33,392 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-06-14 14:37:33,392 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow [2024-06-14 14:37:33,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:33,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:33,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:33,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:37:33,393 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-14 14:37:33,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash 811259214, now seen corresponding path program 1 times [2024-06-14 14:37:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:33,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297132336] [2024-06-14 14:37:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:39,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:39,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297132336] [2024-06-14 14:37:39,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297132336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:39,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:39,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:37:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741541713] [2024-06-14 14:37:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:39,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:37:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:37:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:37:40,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-14 14:37:40,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 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-14 14:37:40,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:40,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-14 14:37:40,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:41,193 INFO L124 PetriNetUnfolderBase]: 1357/2125 cut-off events. [2024-06-14 14:37:41,193 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2024-06-14 14:37:41,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4794 conditions, 2125 events. 1357/2125 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10692 event pairs, 840 based on Foata normal form. 3/2124 useless extension candidates. Maximal degree in co-relation 4779. Up to 2013 conditions per place. [2024-06-14 14:37:41,206 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 41 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-06-14 14:37:41,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 248 flow [2024-06-14 14:37:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:37:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:37:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-06-14 14:37:41,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2024-06-14 14:37:41,210 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 103 transitions. [2024-06-14 14:37:41,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 248 flow [2024-06-14 14:37:41,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:37:41,213 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow [2024-06-14 14:37:41,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-14 14:37:41,214 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-14 14:37:41,214 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow [2024-06-14 14:37:41,215 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-14 14:37:41,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:41,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:41,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:37:41,218 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-14 14:37:41,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash -620766744, now seen corresponding path program 1 times [2024-06-14 14:37:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:41,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290501536] [2024-06-14 14:37:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:47,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290501536] [2024-06-14 14:37:47,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290501536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:47,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:47,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:37:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412963956] [2024-06-14 14:37:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:47,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:37:47,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:37:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:37:47,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:37:47,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:47,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:47,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:37:47,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:49,062 INFO L124 PetriNetUnfolderBase]: 1598/2490 cut-off events. [2024-06-14 14:37:49,062 INFO L125 PetriNetUnfolderBase]: For 1293/1293 co-relation queries the response was YES. [2024-06-14 14:37:49,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 2490 events. 1598/2490 cut-off events. For 1293/1293 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12483 event pairs, 915 based on Foata normal form. 3/2492 useless extension candidates. Maximal degree in co-relation 6187. Up to 2350 conditions per place. [2024-06-14 14:37:49,074 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2024-06-14 14:37:49,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 328 flow [2024-06-14 14:37:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:37:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:37:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-06-14 14:37:49,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5545454545454546 [2024-06-14 14:37:49,076 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 122 transitions. [2024-06-14 14:37:49,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 328 flow [2024-06-14 14:37:49,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 314 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 14:37:49,078 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 178 flow [2024-06-14 14:37:49,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-14 14:37:49,079 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-06-14 14:37:49,079 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow [2024-06-14 14:37:49,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:49,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:49,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:49,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:37:49,080 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-14 14:37:49,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2063898451, now seen corresponding path program 1 times [2024-06-14 14:37:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:49,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537318135] [2024-06-14 14:37:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:55,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-14 14:37:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:55,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537318135] [2024-06-14 14:37:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537318135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:55,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:37:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566353335] [2024-06-14 14:37:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:55,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:37:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:55,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:37:55,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:37:55,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:37:55,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:55,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:55,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:37:55,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:57,252 INFO L124 PetriNetUnfolderBase]: 1592/2480 cut-off events. [2024-06-14 14:37:57,253 INFO L125 PetriNetUnfolderBase]: For 2422/2422 co-relation queries the response was YES. [2024-06-14 14:37:57,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6774 conditions, 2480 events. 1592/2480 cut-off events. For 2422/2422 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12535 event pairs, 791 based on Foata normal form. 3/2482 useless extension candidates. Maximal degree in co-relation 6756. Up to 2326 conditions per place. [2024-06-14 14:37:57,262 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 56 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-06-14 14:37:57,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 406 flow [2024-06-14 14:37:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:37:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:37:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-06-14 14:37:57,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-06-14 14:37:57,264 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 6 states and 144 transitions. [2024-06-14 14:37:57,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 406 flow [2024-06-14 14:37:57,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 382 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:37:57,266 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 214 flow [2024-06-14 14:37:57,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-14 14:37:57,267 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2024-06-14 14:37:57,267 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 214 flow [2024-06-14 14:37:57,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:57,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:57,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:57,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:37:57,268 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-14 14:37:57,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash -421973203, now seen corresponding path program 1 times [2024-06-14 14:37:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:57,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709259504] [2024-06-14 14:37:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:11,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:11,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709259504] [2024-06-14 14:38:11,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709259504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:11,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:11,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:38:11,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245186239] [2024-06-14 14:38:11,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:11,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:38:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:11,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:38:11,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:38:11,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:38:11,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:11,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:11,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:38:11,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:13,261 INFO L124 PetriNetUnfolderBase]: 1740/2795 cut-off events. [2024-06-14 14:38:13,261 INFO L125 PetriNetUnfolderBase]: For 4262/4262 co-relation queries the response was YES. [2024-06-14 14:38:13,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 2795 events. 1740/2795 cut-off events. For 4262/4262 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14481 event pairs, 933 based on Foata normal form. 4/2798 useless extension candidates. Maximal degree in co-relation 8056. Up to 2573 conditions per place. [2024-06-14 14:38:13,273 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 47 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2024-06-14 14:38:13,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 370 flow [2024-06-14 14:38:13,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:38:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:38:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-06-14 14:38:13,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-06-14 14:38:13,274 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 214 flow. Second operand 5 states and 104 transitions. [2024-06-14 14:38:13,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 370 flow [2024-06-14 14:38:13,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 336 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 14:38:13,277 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 226 flow [2024-06-14 14:38:13,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-14 14:38:13,278 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-06-14 14:38:13,278 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 226 flow [2024-06-14 14:38:13,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:13,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:13,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:13,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:38:13,279 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:38:13,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash -23648614, now seen corresponding path program 1 times [2024-06-14 14:38:13,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:13,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945782830] [2024-06-14 14:38:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945782830] [2024-06-14 14:38:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945782830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:22,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:22,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:38:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321636003] [2024-06-14 14:38:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:22,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:38:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:22,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:38:22,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:38:23,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:38:23,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:23,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:23,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:38:23,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:24,753 INFO L124 PetriNetUnfolderBase]: 1817/2859 cut-off events. [2024-06-14 14:38:24,753 INFO L125 PetriNetUnfolderBase]: For 5804/5804 co-relation queries the response was YES. [2024-06-14 14:38:24,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8878 conditions, 2859 events. 1817/2859 cut-off events. For 5804/5804 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14487 event pairs, 724 based on Foata normal form. 3/2861 useless extension candidates. Maximal degree in co-relation 8857. Up to 2625 conditions per place. [2024-06-14 14:38:24,767 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 74 selfloop transitions, 19 changer transitions 0/98 dead transitions. [2024-06-14 14:38:24,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 554 flow [2024-06-14 14:38:24,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:38:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:38:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-06-14 14:38:24,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142045454545454 [2024-06-14 14:38:24,771 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 226 flow. Second operand 8 states and 181 transitions. [2024-06-14 14:38:24,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 554 flow [2024-06-14 14:38:24,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 532 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 14:38:24,774 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 298 flow [2024-06-14 14:38:24,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=298, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-06-14 14:38:24,774 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-06-14 14:38:24,775 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 298 flow [2024-06-14 14:38:24,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:38:24,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:24,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:24,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:38:24,775 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-14 14:38:24,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash -487386576, now seen corresponding path program 1 times [2024-06-14 14:38:24,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:24,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960536674] [2024-06-14 14:38:24,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:24,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:38,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:38,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960536674] [2024-06-14 14:38:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960536674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:38,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:38,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:38:38,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831241342] [2024-06-14 14:38:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:38,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:38:38,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:38,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:38:38,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:38:38,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:38:38,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-14 14:38:38,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:38,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:38:38,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:39,631 INFO L124 PetriNetUnfolderBase]: 1772/2824 cut-off events. [2024-06-14 14:38:39,631 INFO L125 PetriNetUnfolderBase]: For 8227/8227 co-relation queries the response was YES. [2024-06-14 14:38:39,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9557 conditions, 2824 events. 1772/2824 cut-off events. For 8227/8227 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14572 event pairs, 679 based on Foata normal form. 4/2826 useless extension candidates. Maximal degree in co-relation 9535. Up to 2571 conditions per place. [2024-06-14 14:38:39,645 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 64 selfloop transitions, 16 changer transitions 0/87 dead transitions. [2024-06-14 14:38:39,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 590 flow [2024-06-14 14:38:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:38:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:38:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-06-14 14:38:39,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-06-14 14:38:39,646 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 298 flow. Second operand 6 states and 130 transitions. [2024-06-14 14:38:39,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 590 flow [2024-06-14 14:38:39,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 540 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 14:38:39,650 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 360 flow [2024-06-14 14:38:39,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-06-14 14:38:39,651 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-06-14 14:38:39,651 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 360 flow [2024-06-14 14:38:39,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-14 14:38:39,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:39,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:39,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:38:39,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:38:39,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash -733105512, now seen corresponding path program 1 times [2024-06-14 14:38:39,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:39,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65107908] [2024-06-14 14:38:39,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:39,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65107908] [2024-06-14 14:38:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65107908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:48,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:38:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956854998] [2024-06-14 14:38:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:48,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:38:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:48,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:38:48,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:38:48,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:38:48,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 360 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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-14 14:38:48,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:48,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:38:48,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:50,525 INFO L124 PetriNetUnfolderBase]: 1846/2877 cut-off events. [2024-06-14 14:38:50,525 INFO L125 PetriNetUnfolderBase]: For 10861/10861 co-relation queries the response was YES. [2024-06-14 14:38:50,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10549 conditions, 2877 events. 1846/2877 cut-off events. For 10861/10861 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14475 event pairs, 554 based on Foata normal form. 6/2882 useless extension candidates. Maximal degree in co-relation 10524. Up to 2635 conditions per place. [2024-06-14 14:38:50,537 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 87 selfloop transitions, 21 changer transitions 0/113 dead transitions. [2024-06-14 14:38:50,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 113 transitions, 712 flow [2024-06-14 14:38:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:38:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:38:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-14 14:38:50,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 14:38:50,540 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 360 flow. Second operand 9 states and 198 transitions. [2024-06-14 14:38:50,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 113 transitions, 712 flow [2024-06-14 14:38:50,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 113 transitions, 694 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-14 14:38:50,546 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 411 flow [2024-06-14 14:38:50,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=411, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-06-14 14:38:50,547 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2024-06-14 14:38:50,547 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 411 flow [2024-06-14 14:38:50,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 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-14 14:38:50,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:50,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:50,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:38:50,548 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-14 14:38:50,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash -487119666, now seen corresponding path program 2 times [2024-06-14 14:38:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:50,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984227441] [2024-06-14 14:38:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984227441] [2024-06-14 14:39:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984227441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:39:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286510603] [2024-06-14 14:39:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:04,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:39:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:39:04,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:39:04,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:39:04,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 411 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-14 14:39:04,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:04,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:39:04,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:05,794 INFO L124 PetriNetUnfolderBase]: 1753/2780 cut-off events. [2024-06-14 14:39:05,795 INFO L125 PetriNetUnfolderBase]: For 13536/13536 co-relation queries the response was YES. [2024-06-14 14:39:05,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10730 conditions, 2780 events. 1753/2780 cut-off events. For 13536/13536 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14316 event pairs, 655 based on Foata normal form. 4/2783 useless extension candidates. Maximal degree in co-relation 10703. Up to 2581 conditions per place. [2024-06-14 14:39:05,810 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 64 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2024-06-14 14:39:05,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 603 flow [2024-06-14 14:39:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:39:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:39:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-14 14:39:05,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-14 14:39:05,812 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 411 flow. Second operand 6 states and 121 transitions. [2024-06-14 14:39:05,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 603 flow [2024-06-14 14:39:05,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 528 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 14:39:05,820 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 366 flow [2024-06-14 14:39:05,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-06-14 14:39:05,821 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-06-14 14:39:05,821 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 366 flow [2024-06-14 14:39:05,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-14 14:39:05,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:05,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:05,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:39:05,821 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-14 14:39:05,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash 130408690, now seen corresponding path program 1 times [2024-06-14 14:39:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574384500] [2024-06-14 14:39:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574384500] [2024-06-14 14:39:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574384500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:39:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495227138] [2024-06-14 14:39:20,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:20,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:39:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:20,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:39:20,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:39:20,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:39:20,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:20,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:20,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:39:20,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:22,027 INFO L124 PetriNetUnfolderBase]: 1874/2907 cut-off events. [2024-06-14 14:39:22,027 INFO L125 PetriNetUnfolderBase]: For 16103/16103 co-relation queries the response was YES. [2024-06-14 14:39:22,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11362 conditions, 2907 events. 1874/2907 cut-off events. For 16103/16103 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14654 event pairs, 619 based on Foata normal form. 4/2909 useless extension candidates. Maximal degree in co-relation 11333. Up to 2649 conditions per place. [2024-06-14 14:39:22,040 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 73 selfloop transitions, 24 changer transitions 0/102 dead transitions. [2024-06-14 14:39:22,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 732 flow [2024-06-14 14:39:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:39:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:39:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-14 14:39:22,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2024-06-14 14:39:22,042 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 366 flow. Second operand 7 states and 146 transitions. [2024-06-14 14:39:22,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 732 flow [2024-06-14 14:39:22,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 700 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 14:39:22,049 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 452 flow [2024-06-14 14:39:22,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=452, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2024-06-14 14:39:22,050 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2024-06-14 14:39:22,050 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 452 flow [2024-06-14 14:39:22,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:22,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:22,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:22,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:39:22,051 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-14 14:39:22,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash 130588180, now seen corresponding path program 2 times [2024-06-14 14:39:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:22,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060179025] [2024-06-14 14:39:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060179025] [2024-06-14 14:39:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060179025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:37,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:37,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:39:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901335462] [2024-06-14 14:39:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:37,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:39:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:39:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:39:37,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:39:37,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 452 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:37,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:37,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:39:37,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:39,042 INFO L124 PetriNetUnfolderBase]: 1896/2939 cut-off events. [2024-06-14 14:39:39,043 INFO L125 PetriNetUnfolderBase]: For 19595/19595 co-relation queries the response was YES. [2024-06-14 14:39:39,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12202 conditions, 2939 events. 1896/2939 cut-off events. For 19595/19595 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14809 event pairs, 626 based on Foata normal form. 4/2941 useless extension candidates. Maximal degree in co-relation 12173. Up to 2668 conditions per place. [2024-06-14 14:39:39,056 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 71 selfloop transitions, 26 changer transitions 0/102 dead transitions. [2024-06-14 14:39:39,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 102 transitions, 792 flow [2024-06-14 14:39:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:39:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:39:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-14 14:39:39,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-06-14 14:39:39,057 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 452 flow. Second operand 7 states and 144 transitions. [2024-06-14 14:39:39,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 102 transitions, 792 flow [2024-06-14 14:39:39,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 744 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-14 14:39:39,070 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 498 flow [2024-06-14 14:39:39,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=498, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2024-06-14 14:39:39,071 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-06-14 14:39:39,071 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 498 flow [2024-06-14 14:39:39,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:39,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:39,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:39,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:39:39,072 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-14 14:39:39,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -885936270, now seen corresponding path program 3 times [2024-06-14 14:39:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290341054] [2024-06-14 14:39:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:52,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290341054] [2024-06-14 14:39:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290341054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:52,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:39:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910348886] [2024-06-14 14:39:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:52,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:39:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:39:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:39:53,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:39:53,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 498 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:53,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:53,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:39:53,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:54,759 INFO L124 PetriNetUnfolderBase]: 1886/2928 cut-off events. [2024-06-14 14:39:54,760 INFO L125 PetriNetUnfolderBase]: For 22118/22118 co-relation queries the response was YES. [2024-06-14 14:39:54,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12426 conditions, 2928 events. 1886/2928 cut-off events. For 22118/22118 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14738 event pairs, 650 based on Foata normal form. 4/2931 useless extension candidates. Maximal degree in co-relation 12395. Up to 2749 conditions per place. [2024-06-14 14:39:54,771 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 77 selfloop transitions, 14 changer transitions 0/96 dead transitions. [2024-06-14 14:39:54,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 736 flow [2024-06-14 14:39:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:39:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:39:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-14 14:39:54,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2024-06-14 14:39:54,773 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 498 flow. Second operand 7 states and 134 transitions. [2024-06-14 14:39:54,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 736 flow [2024-06-14 14:39:54,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 96 transitions, 668 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-14 14:39:54,790 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 466 flow [2024-06-14 14:39:54,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2024-06-14 14:39:54,791 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2024-06-14 14:39:54,791 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 466 flow [2024-06-14 14:39:54,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:54,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:54,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:54,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:39:54,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:39:54,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 367071370, now seen corresponding path program 1 times [2024-06-14 14:39:54,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:54,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788500248] [2024-06-14 14:39:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:11,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788500248] [2024-06-14 14:40:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788500248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:11,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:11,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:40:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238206352] [2024-06-14 14:40:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:11,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:40:11,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:40:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:40:11,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:40:11,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 466 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:11,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:11,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:40:11,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:13,725 INFO L124 PetriNetUnfolderBase]: 2196/3377 cut-off events. [2024-06-14 14:40:13,725 INFO L125 PetriNetUnfolderBase]: For 29051/29051 co-relation queries the response was YES. [2024-06-14 14:40:13,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14240 conditions, 3377 events. 2196/3377 cut-off events. For 29051/29051 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16744 event pairs, 806 based on Foata normal form. 4/3380 useless extension candidates. Maximal degree in co-relation 14208. Up to 3176 conditions per place. [2024-06-14 14:40:13,741 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 76 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2024-06-14 14:40:13,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 747 flow [2024-06-14 14:40:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:40:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:40:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-14 14:40:13,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 14:40:13,743 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 466 flow. Second operand 7 states and 133 transitions. [2024-06-14 14:40:13,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 747 flow [2024-06-14 14:40:13,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 100 transitions, 690 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 14:40:13,756 INFO L231 Difference]: Finished difference. Result has 79 places, 80 transitions, 505 flow [2024-06-14 14:40:13,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=505, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2024-06-14 14:40:13,757 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2024-06-14 14:40:13,757 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 505 flow [2024-06-14 14:40:13,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:13,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:13,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:13,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:40:13,758 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:40:13,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash -592360166, now seen corresponding path program 1 times [2024-06-14 14:40:13,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:13,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028078931] [2024-06-14 14:40:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028078931] [2024-06-14 14:40:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028078931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:40:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412410671] [2024-06-14 14:40:33,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:33,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:40:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:40:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:40:33,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:40:33,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-14 14:40:33,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:33,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:40:33,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:35,395 INFO L124 PetriNetUnfolderBase]: 2377/3627 cut-off events. [2024-06-14 14:40:35,395 INFO L125 PetriNetUnfolderBase]: For 37842/37842 co-relation queries the response was YES. [2024-06-14 14:40:35,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16287 conditions, 3627 events. 2377/3627 cut-off events. For 37842/37842 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17814 event pairs, 976 based on Foata normal form. 1/3627 useless extension candidates. Maximal degree in co-relation 16253. Up to 3524 conditions per place. [2024-06-14 14:40:35,413 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 73 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2024-06-14 14:40:35,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 91 transitions, 711 flow [2024-06-14 14:40:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:40:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:40:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-14 14:40:35,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-06-14 14:40:35,415 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 505 flow. Second operand 5 states and 94 transitions. [2024-06-14 14:40:35,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 91 transitions, 711 flow [2024-06-14 14:40:35,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 91 transitions, 664 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 14:40:35,469 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 510 flow [2024-06-14 14:40:35,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2024-06-14 14:40:35,471 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2024-06-14 14:40:35,471 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 510 flow [2024-06-14 14:40:35,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-14 14:40:35,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:35,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:35,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:40:35,471 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-14 14:40:35,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:35,472 INFO L85 PathProgramCache]: Analyzing trace with hash -227231695, now seen corresponding path program 1 times [2024-06-14 14:40:35,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:35,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753635947] [2024-06-14 14:40:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:35,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:50,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:50,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753635947] [2024-06-14 14:40:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753635947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:50,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:40:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454609053] [2024-06-14 14:40:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:50,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:40:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:40:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:40:50,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:40:50,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 510 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 14:40:50,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:50,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:40:50,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:52,715 INFO L124 PetriNetUnfolderBase]: 2299/3511 cut-off events. [2024-06-14 14:40:52,715 INFO L125 PetriNetUnfolderBase]: For 41739/41745 co-relation queries the response was YES. [2024-06-14 14:40:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16392 conditions, 3511 events. 2299/3511 cut-off events. For 41739/41745 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17827 event pairs, 769 based on Foata normal form. 4/3492 useless extension candidates. Maximal degree in co-relation 16357. Up to 3117 conditions per place. [2024-06-14 14:40:52,736 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 83 selfloop transitions, 37 changer transitions 0/127 dead transitions. [2024-06-14 14:40:52,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 127 transitions, 974 flow [2024-06-14 14:40:52,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:40:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:40:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-06-14 14:40:52,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-14 14:40:52,740 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 510 flow. Second operand 8 states and 168 transitions. [2024-06-14 14:40:52,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 127 transitions, 974 flow [2024-06-14 14:40:52,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 127 transitions, 944 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:52,760 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 636 flow [2024-06-14 14:40:52,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=636, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2024-06-14 14:40:52,761 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-06-14 14:40:52,761 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 636 flow [2024-06-14 14:40:52,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 14:40:52,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:52,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:40:52,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:40:52,762 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-14 14:40:52,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2032986687, now seen corresponding path program 2 times [2024-06-14 14:40:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:52,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696370725] [2024-06-14 14:40:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:06,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:06,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696370725] [2024-06-14 14:41:06,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696370725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:06,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:06,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:41:06,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432328413] [2024-06-14 14:41:06,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:06,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:41:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:06,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:41:06,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:41:06,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:41:06,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 636 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-14 14:41:06,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:06,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:41:06,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:08,173 INFO L124 PetriNetUnfolderBase]: 2361/3607 cut-off events. [2024-06-14 14:41:08,173 INFO L125 PetriNetUnfolderBase]: For 48631/48635 co-relation queries the response was YES. [2024-06-14 14:41:08,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17758 conditions, 3607 events. 2361/3607 cut-off events. For 48631/48635 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18401 event pairs, 702 based on Foata normal form. 4/3592 useless extension candidates. Maximal degree in co-relation 17722. Up to 3161 conditions per place. [2024-06-14 14:41:08,190 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 82 selfloop transitions, 38 changer transitions 0/127 dead transitions. [2024-06-14 14:41:08,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 127 transitions, 1068 flow [2024-06-14 14:41:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:41:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:41:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-14 14:41:08,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943181818181818 [2024-06-14 14:41:08,196 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 636 flow. Second operand 8 states and 174 transitions. [2024-06-14 14:41:08,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 127 transitions, 1068 flow [2024-06-14 14:41:08,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 127 transitions, 987 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-14 14:41:08,218 INFO L231 Difference]: Finished difference. Result has 89 places, 92 transitions, 679 flow [2024-06-14 14:41:08,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=679, PETRI_PLACES=89, PETRI_TRANSITIONS=92} [2024-06-14 14:41:08,219 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-06-14 14:41:08,219 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 679 flow [2024-06-14 14:41:08,219 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-14 14:41:08,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:08,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:08,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:41:08,226 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-14 14:41:08,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:08,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2038550877, now seen corresponding path program 3 times [2024-06-14 14:41:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:08,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896636432] [2024-06-14 14:41:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:21,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896636432] [2024-06-14 14:41:21,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896636432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:21,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:41:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874669368] [2024-06-14 14:41:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:21,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:41:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:41:21,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:41:21,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:41:21,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 679 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-14 14:41:21,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:21,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:41:21,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:23,716 INFO L124 PetriNetUnfolderBase]: 2376/3632 cut-off events. [2024-06-14 14:41:23,717 INFO L125 PetriNetUnfolderBase]: For 53942/53946 co-relation queries the response was YES. [2024-06-14 14:41:23,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18194 conditions, 3632 events. 2376/3632 cut-off events. For 53942/53946 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18502 event pairs, 719 based on Foata normal form. 4/3617 useless extension candidates. Maximal degree in co-relation 18156. Up to 3180 conditions per place. [2024-06-14 14:41:23,734 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 80 selfloop transitions, 40 changer transitions 0/127 dead transitions. [2024-06-14 14:41:23,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 127 transitions, 1105 flow [2024-06-14 14:41:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:41:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:41:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-14 14:41:23,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2024-06-14 14:41:23,738 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 679 flow. Second operand 8 states and 172 transitions. [2024-06-14 14:41:23,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 127 transitions, 1105 flow [2024-06-14 14:41:23,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 127 transitions, 1025 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 14:41:23,763 INFO L231 Difference]: Finished difference. Result has 92 places, 95 transitions, 725 flow [2024-06-14 14:41:23,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=725, PETRI_PLACES=92, PETRI_TRANSITIONS=95} [2024-06-14 14:41:23,763 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-06-14 14:41:23,763 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 725 flow [2024-06-14 14:41:23,764 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-14 14:41:23,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:23,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:23,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:41:23,764 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-14 14:41:23,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1685005309, now seen corresponding path program 1 times [2024-06-14 14:41:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332031852] [2024-06-14 14:41:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:37,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:37,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332031852] [2024-06-14 14:41:37,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332031852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:37,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:37,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:41:37,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582370499] [2024-06-14 14:41:37,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:37,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:41:37,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:37,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:41:37,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:41:37,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:41:37,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 725 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 14:41:37,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:37,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:41:37,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:39,668 INFO L124 PetriNetUnfolderBase]: 2401/3666 cut-off events. [2024-06-14 14:41:39,669 INFO L125 PetriNetUnfolderBase]: For 61915/61924 co-relation queries the response was YES. [2024-06-14 14:41:39,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18866 conditions, 3666 events. 2401/3666 cut-off events. For 61915/61924 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18273 event pairs, 860 based on Foata normal form. 6/3634 useless extension candidates. Maximal degree in co-relation 18827. Up to 3406 conditions per place. [2024-06-14 14:41:39,685 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 92 selfloop transitions, 19 changer transitions 0/121 dead transitions. [2024-06-14 14:41:39,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 121 transitions, 1065 flow [2024-06-14 14:41:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:41:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:41:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-14 14:41:39,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2024-06-14 14:41:39,688 INFO L175 Difference]: Start difference. First operand has 92 places, 95 transitions, 725 flow. Second operand 7 states and 134 transitions. [2024-06-14 14:41:39,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 121 transitions, 1065 flow [2024-06-14 14:41:39,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 984 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 14:41:39,710 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 772 flow [2024-06-14 14:41:39,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=772, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2024-06-14 14:41:39,711 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2024-06-14 14:41:39,711 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 772 flow [2024-06-14 14:41:39,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 14:41:39,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:39,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:39,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:41:39,712 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-14 14:41:39,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1515230869, now seen corresponding path program 4 times [2024-06-14 14:41:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:39,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023786579] [2024-06-14 14:41:39,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023786579] [2024-06-14 14:41:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023786579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:54,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:41:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384956510] [2024-06-14 14:41:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:54,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:41:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:54,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:41:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:41:54,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:41:54,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 772 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 14:41:54,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:54,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:41:54,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:56,354 INFO L124 PetriNetUnfolderBase]: 2375/3632 cut-off events. [2024-06-14 14:41:56,354 INFO L125 PetriNetUnfolderBase]: For 64660/64660 co-relation queries the response was YES. [2024-06-14 14:41:56,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18918 conditions, 3632 events. 2375/3632 cut-off events. For 64660/64660 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18478 event pairs, 771 based on Foata normal form. 6/3622 useless extension candidates. Maximal degree in co-relation 18878. Up to 3329 conditions per place. [2024-06-14 14:41:56,373 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 98 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2024-06-14 14:41:56,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 127 transitions, 1082 flow [2024-06-14 14:41:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:41:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:41:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 14:41:56,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 14:41:56,380 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 772 flow. Second operand 8 states and 152 transitions. [2024-06-14 14:41:56,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 127 transitions, 1082 flow [2024-06-14 14:41:56,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 127 transitions, 1016 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 14:41:56,415 INFO L231 Difference]: Finished difference. Result has 97 places, 101 transitions, 758 flow [2024-06-14 14:41:56,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=758, PETRI_PLACES=97, PETRI_TRANSITIONS=101} [2024-06-14 14:41:56,416 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 52 predicate places. [2024-06-14 14:41:56,416 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 101 transitions, 758 flow [2024-06-14 14:41:56,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 14:41:56,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:56,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:41:56,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:41:56,417 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:41:56,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1183294850, now seen corresponding path program 1 times [2024-06-14 14:41:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:56,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452400553] [2024-06-14 14:41:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:18,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:18,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452400553] [2024-06-14 14:42:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452400553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:18,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:18,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:42:18,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658586521] [2024-06-14 14:42:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:18,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:42:18,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:42:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:42:18,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:42:18,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 101 transitions, 758 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:18,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:18,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:42:18,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:20,462 INFO L124 PetriNetUnfolderBase]: 2433/3714 cut-off events. [2024-06-14 14:42:20,462 INFO L125 PetriNetUnfolderBase]: For 72137/72141 co-relation queries the response was YES. [2024-06-14 14:42:20,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19765 conditions, 3714 events. 2433/3714 cut-off events. For 72137/72141 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18193 event pairs, 940 based on Foata normal form. 7/3716 useless extension candidates. Maximal degree in co-relation 19724. Up to 3558 conditions per place. [2024-06-14 14:42:20,481 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 90 selfloop transitions, 11 changer transitions 0/115 dead transitions. [2024-06-14 14:42:20,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 115 transitions, 1014 flow [2024-06-14 14:42:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:42:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:42:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-14 14:42:20,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 14:42:20,482 INFO L175 Difference]: Start difference. First operand has 97 places, 101 transitions, 758 flow. Second operand 6 states and 110 transitions. [2024-06-14 14:42:20,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 115 transitions, 1014 flow [2024-06-14 14:42:20,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 912 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 14:42:20,514 INFO L231 Difference]: Finished difference. Result has 93 places, 104 transitions, 718 flow [2024-06-14 14:42:20,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=718, PETRI_PLACES=93, PETRI_TRANSITIONS=104} [2024-06-14 14:42:20,514 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2024-06-14 14:42:20,514 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 104 transitions, 718 flow [2024-06-14 14:42:20,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:20,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:20,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:20,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:42:20,515 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-14 14:42:20,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash 764094185, now seen corresponding path program 1 times [2024-06-14 14:42:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:20,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356133030] [2024-06-14 14:42:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:20,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:36,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:36,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356133030] [2024-06-14 14:42:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356133030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:36,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:42:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122252357] [2024-06-14 14:42:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:36,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:42:36,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:36,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:42:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:42:36,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:42:36,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 104 transitions, 718 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:36,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:36,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:42:36,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:38,956 INFO L124 PetriNetUnfolderBase]: 2419/3704 cut-off events. [2024-06-14 14:42:38,956 INFO L125 PetriNetUnfolderBase]: For 76314/76316 co-relation queries the response was YES. [2024-06-14 14:42:38,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20096 conditions, 3704 events. 2419/3704 cut-off events. For 76314/76316 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18968 event pairs, 756 based on Foata normal form. 4/3692 useless extension candidates. Maximal degree in co-relation 20055. Up to 3439 conditions per place. [2024-06-14 14:42:38,975 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 120 selfloop transitions, 20 changer transitions 0/147 dead transitions. [2024-06-14 14:42:38,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 147 transitions, 1144 flow [2024-06-14 14:42:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:42:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:42:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-14 14:42:38,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45202020202020204 [2024-06-14 14:42:38,979 INFO L175 Difference]: Start difference. First operand has 93 places, 104 transitions, 718 flow. Second operand 9 states and 179 transitions. [2024-06-14 14:42:38,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 147 transitions, 1144 flow [2024-06-14 14:42:39,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 147 transitions, 1104 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 14:42:39,008 INFO L231 Difference]: Finished difference. Result has 98 places, 107 transitions, 774 flow [2024-06-14 14:42:39,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=98, PETRI_TRANSITIONS=107} [2024-06-14 14:42:39,008 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2024-06-14 14:42:39,008 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 774 flow [2024-06-14 14:42:39,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:39,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:39,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:39,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:42:39,009 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-14 14:42:39,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1545753357, now seen corresponding path program 2 times [2024-06-14 14:42:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:39,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310191839] [2024-06-14 14:42:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:42:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310191839] [2024-06-14 14:42:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310191839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:53,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:53,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:42:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036223855] [2024-06-14 14:42:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:53,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:42:53,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:53,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:42:53,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:42:54,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:42:54,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 774 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:54,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:54,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:42:54,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:56,370 INFO L124 PetriNetUnfolderBase]: 2464/3765 cut-off events. [2024-06-14 14:42:56,370 INFO L125 PetriNetUnfolderBase]: For 84571/84571 co-relation queries the response was YES. [2024-06-14 14:42:56,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21196 conditions, 3765 events. 2464/3765 cut-off events. For 84571/84571 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19225 event pairs, 647 based on Foata normal form. 4/3759 useless extension candidates. Maximal degree in co-relation 21154. Up to 3164 conditions per place. [2024-06-14 14:42:56,389 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 95 selfloop transitions, 54 changer transitions 0/156 dead transitions. [2024-06-14 14:42:56,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 156 transitions, 1364 flow [2024-06-14 14:42:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:42:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:42:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2024-06-14 14:42:56,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-06-14 14:42:56,390 INFO L175 Difference]: Start difference. First operand has 98 places, 107 transitions, 774 flow. Second operand 9 states and 188 transitions. [2024-06-14 14:42:56,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 156 transitions, 1364 flow [2024-06-14 14:42:56,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 156 transitions, 1292 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 14:42:56,428 INFO L231 Difference]: Finished difference. Result has 100 places, 113 transitions, 920 flow [2024-06-14 14:42:56,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=920, PETRI_PLACES=100, PETRI_TRANSITIONS=113} [2024-06-14 14:42:56,429 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2024-06-14 14:42:56,429 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 113 transitions, 920 flow [2024-06-14 14:42:56,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:56,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:56,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:42:56,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:42:56,430 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:42:56,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1401920833, now seen corresponding path program 3 times [2024-06-14 14:42:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:56,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556507387] [2024-06-14 14:42:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:10,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556507387] [2024-06-14 14:43:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556507387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:10,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:10,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:43:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509565070] [2024-06-14 14:43:10,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:10,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:43:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:10,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:43:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:43:10,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:43:10,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 113 transitions, 920 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:10,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:10,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:43:10,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:12,449 INFO L124 PetriNetUnfolderBase]: 2760/4216 cut-off events. [2024-06-14 14:43:12,449 INFO L125 PetriNetUnfolderBase]: For 102820/102833 co-relation queries the response was YES. [2024-06-14 14:43:12,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24507 conditions, 4216 events. 2760/4216 cut-off events. For 102820/102833 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 22086 event pairs, 1096 based on Foata normal form. 4/4184 useless extension candidates. Maximal degree in co-relation 24464. Up to 3605 conditions per place. [2024-06-14 14:43:12,471 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 128 selfloop transitions, 57 changer transitions 0/192 dead transitions. [2024-06-14 14:43:12,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 192 transitions, 1892 flow [2024-06-14 14:43:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-14 14:43:12,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-06-14 14:43:12,474 INFO L175 Difference]: Start difference. First operand has 100 places, 113 transitions, 920 flow. Second operand 10 states and 193 transitions. [2024-06-14 14:43:12,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 192 transitions, 1892 flow [2024-06-14 14:43:12,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 192 transitions, 1712 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-06-14 14:43:12,539 INFO L231 Difference]: Finished difference. Result has 110 places, 151 transitions, 1368 flow [2024-06-14 14:43:12,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1368, PETRI_PLACES=110, PETRI_TRANSITIONS=151} [2024-06-14 14:43:12,539 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 65 predicate places. [2024-06-14 14:43:12,539 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 151 transitions, 1368 flow [2024-06-14 14:43:12,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:12,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:12,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:12,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:43:12,540 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-14 14:43:12,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1024546749, now seen corresponding path program 4 times [2024-06-14 14:43:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:12,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569891920] [2024-06-14 14:43:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569891920] [2024-06-14 14:43:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569891920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:43:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263567466] [2024-06-14 14:43:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:31,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:43:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:43:31,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:43:32,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:43:32,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 151 transitions, 1368 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:32,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:32,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:43:32,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:34,822 INFO L124 PetriNetUnfolderBase]: 3317/5071 cut-off events. [2024-06-14 14:43:34,823 INFO L125 PetriNetUnfolderBase]: For 109175/109182 co-relation queries the response was YES. [2024-06-14 14:43:34,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29409 conditions, 5071 events. 3317/5071 cut-off events. For 109175/109182 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 27366 event pairs, 700 based on Foata normal form. 10/5070 useless extension candidates. Maximal degree in co-relation 29359. Up to 3989 conditions per place. [2024-06-14 14:43:34,849 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 185 selfloop transitions, 153 changer transitions 0/345 dead transitions. [2024-06-14 14:43:34,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 345 transitions, 3811 flow [2024-06-14 14:43:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2024-06-14 14:43:34,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47045454545454546 [2024-06-14 14:43:34,852 INFO L175 Difference]: Start difference. First operand has 110 places, 151 transitions, 1368 flow. Second operand 10 states and 207 transitions. [2024-06-14 14:43:34,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 345 transitions, 3811 flow [2024-06-14 14:43:34,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 345 transitions, 3681 flow, removed 64 selfloop flow, removed 1 redundant places. [2024-06-14 14:43:34,926 INFO L231 Difference]: Finished difference. Result has 124 places, 282 transitions, 3202 flow [2024-06-14 14:43:34,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3202, PETRI_PLACES=124, PETRI_TRANSITIONS=282} [2024-06-14 14:43:34,926 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 79 predicate places. [2024-06-14 14:43:34,926 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 282 transitions, 3202 flow [2024-06-14 14:43:34,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:34,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:34,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:34,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:43:34,927 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-14 14:43:34,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:34,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1097952177, now seen corresponding path program 5 times [2024-06-14 14:43:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:34,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409049928] [2024-06-14 14:43:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:34,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:54,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:54,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409049928] [2024-06-14 14:43:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409049928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:54,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:43:54,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767531200] [2024-06-14 14:43:54,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:54,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:43:54,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:54,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:43:54,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:43:54,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:43:54,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 282 transitions, 3202 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:54,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:54,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:43:54,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:57,125 INFO L124 PetriNetUnfolderBase]: 3702/5637 cut-off events. [2024-06-14 14:43:57,125 INFO L125 PetriNetUnfolderBase]: For 130048/130069 co-relation queries the response was YES. [2024-06-14 14:43:57,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36148 conditions, 5637 events. 3702/5637 cut-off events. For 130048/130069 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31142 event pairs, 1202 based on Foata normal form. 12/5620 useless extension candidates. Maximal degree in co-relation 36090. Up to 4677 conditions per place. [2024-06-14 14:43:57,160 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 248 selfloop transitions, 186 changer transitions 0/441 dead transitions. [2024-06-14 14:43:57,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 441 transitions, 5786 flow [2024-06-14 14:43:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-14 14:43:57,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46136363636363636 [2024-06-14 14:43:57,163 INFO L175 Difference]: Start difference. First operand has 124 places, 282 transitions, 3202 flow. Second operand 10 states and 203 transitions. [2024-06-14 14:43:57,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 441 transitions, 5786 flow [2024-06-14 14:43:57,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 441 transitions, 5691 flow, removed 42 selfloop flow, removed 2 redundant places. [2024-06-14 14:43:57,336 INFO L231 Difference]: Finished difference. Result has 137 places, 386 transitions, 5256 flow [2024-06-14 14:43:57,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3151, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5256, PETRI_PLACES=137, PETRI_TRANSITIONS=386} [2024-06-14 14:43:57,337 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 92 predicate places. [2024-06-14 14:43:57,337 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 386 transitions, 5256 flow [2024-06-14 14:43:57,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:57,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:57,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:43:57,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:43:57,338 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-14 14:43:57,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash 238174173, now seen corresponding path program 6 times [2024-06-14 14:43:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:57,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131406912] [2024-06-14 14:43:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131406912] [2024-06-14 14:44:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131406912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:16,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:16,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:44:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063134815] [2024-06-14 14:44:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:16,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:44:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:16,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:44:16,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:44:17,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:44:17,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 386 transitions, 5256 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:17,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:17,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:44:17,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:19,760 INFO L124 PetriNetUnfolderBase]: 3742/5701 cut-off events. [2024-06-14 14:44:19,761 INFO L125 PetriNetUnfolderBase]: For 141449/141468 co-relation queries the response was YES. [2024-06-14 14:44:19,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38252 conditions, 5701 events. 3742/5701 cut-off events. For 141449/141468 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 31610 event pairs, 1205 based on Foata normal form. 14/5687 useless extension candidates. Maximal degree in co-relation 38187. Up to 4698 conditions per place. [2024-06-14 14:44:19,802 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 262 selfloop transitions, 199 changer transitions 0/468 dead transitions. [2024-06-14 14:44:19,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 468 transitions, 6820 flow [2024-06-14 14:44:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:44:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:44:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 238 transitions. [2024-06-14 14:44:19,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2024-06-14 14:44:19,806 INFO L175 Difference]: Start difference. First operand has 137 places, 386 transitions, 5256 flow. Second operand 12 states and 238 transitions. [2024-06-14 14:44:19,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 468 transitions, 6820 flow [2024-06-14 14:44:19,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 468 transitions, 6510 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-06-14 14:44:19,946 INFO L231 Difference]: Finished difference. Result has 148 places, 405 transitions, 5729 flow [2024-06-14 14:44:19,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4960, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5729, PETRI_PLACES=148, PETRI_TRANSITIONS=405} [2024-06-14 14:44:19,947 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 103 predicate places. [2024-06-14 14:44:19,947 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 405 transitions, 5729 flow [2024-06-14 14:44:19,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:19,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:19,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:19,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:44:19,948 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-14 14:44:19,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1491120247, now seen corresponding path program 1 times [2024-06-14 14:44:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553589475] [2024-06-14 14:44:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:36,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553589475] [2024-06-14 14:44:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553589475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:36,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:44:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927106436] [2024-06-14 14:44:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:36,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:44:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:44:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:44:36,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:44:36,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 405 transitions, 5729 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:36,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:36,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:44:36,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:39,600 INFO L124 PetriNetUnfolderBase]: 4068/6117 cut-off events. [2024-06-14 14:44:39,601 INFO L125 PetriNetUnfolderBase]: For 167589/167795 co-relation queries the response was YES. [2024-06-14 14:44:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41947 conditions, 6117 events. 4068/6117 cut-off events. For 167589/167795 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 32896 event pairs, 1444 based on Foata normal form. 135/6176 useless extension candidates. Maximal degree in co-relation 41878. Up to 5604 conditions per place. [2024-06-14 14:44:39,648 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 361 selfloop transitions, 77 changer transitions 0/454 dead transitions. [2024-06-14 14:44:39,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 454 transitions, 6982 flow [2024-06-14 14:44:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:44:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:44:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-14 14:44:39,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45202020202020204 [2024-06-14 14:44:39,652 INFO L175 Difference]: Start difference. First operand has 148 places, 405 transitions, 5729 flow. Second operand 9 states and 179 transitions. [2024-06-14 14:44:39,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 454 transitions, 6982 flow [2024-06-14 14:44:39,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 454 transitions, 6428 flow, removed 77 selfloop flow, removed 7 redundant places. [2024-06-14 14:44:39,851 INFO L231 Difference]: Finished difference. Result has 152 places, 422 transitions, 5642 flow [2024-06-14 14:44:39,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5183, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5642, PETRI_PLACES=152, PETRI_TRANSITIONS=422} [2024-06-14 14:44:39,851 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 107 predicate places. [2024-06-14 14:44:39,852 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 422 transitions, 5642 flow [2024-06-14 14:44:39,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:44:39,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:39,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:44:39,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:44:39,852 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:44:39,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash 531688711, now seen corresponding path program 1 times [2024-06-14 14:44:39,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:39,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460383901] [2024-06-14 14:44:39,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:39,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:44:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460383901] [2024-06-14 14:44:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460383901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:59,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:59,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:44:59,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966412038] [2024-06-14 14:44:59,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:59,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:44:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:59,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:44:59,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:45:00,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:45:00,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 422 transitions, 5642 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:00,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:00,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:45:00,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:02,695 INFO L124 PetriNetUnfolderBase]: 3768/5634 cut-off events. [2024-06-14 14:45:02,696 INFO L125 PetriNetUnfolderBase]: For 170282/170788 co-relation queries the response was YES. [2024-06-14 14:45:02,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39725 conditions, 5634 events. 3768/5634 cut-off events. For 170282/170788 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 29097 event pairs, 1351 based on Foata normal form. 124/5648 useless extension candidates. Maximal degree in co-relation 39653. Up to 5288 conditions per place. [2024-06-14 14:45:02,737 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 397 selfloop transitions, 24 changer transitions 0/447 dead transitions. [2024-06-14 14:45:02,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 447 transitions, 6672 flow [2024-06-14 14:45:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:45:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:45:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-14 14:45:02,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2024-06-14 14:45:02,739 INFO L175 Difference]: Start difference. First operand has 152 places, 422 transitions, 5642 flow. Second operand 7 states and 135 transitions. [2024-06-14 14:45:02,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 447 transitions, 6672 flow [2024-06-14 14:45:02,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 447 transitions, 6525 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-14 14:45:02,912 INFO L231 Difference]: Finished difference. Result has 156 places, 429 transitions, 5643 flow [2024-06-14 14:45:02,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5495, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5643, PETRI_PLACES=156, PETRI_TRANSITIONS=429} [2024-06-14 14:45:02,913 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 111 predicate places. [2024-06-14 14:45:02,913 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 429 transitions, 5643 flow [2024-06-14 14:45:02,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:02,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:02,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:02,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:45:02,914 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:45:02,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash 985311021, now seen corresponding path program 2 times [2024-06-14 14:45:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:02,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305330363] [2024-06-14 14:45:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:19,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:19,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305330363] [2024-06-14 14:45:19,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305330363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:19,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:19,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:45:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642694228] [2024-06-14 14:45:19,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:19,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:45:19,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:19,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:45:19,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:45:19,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:45:19,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 429 transitions, 5643 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:19,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:19,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:45:19,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:22,083 INFO L124 PetriNetUnfolderBase]: 4136/6217 cut-off events. [2024-06-14 14:45:22,083 INFO L125 PetriNetUnfolderBase]: For 189347/189549 co-relation queries the response was YES. [2024-06-14 14:45:22,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43349 conditions, 6217 events. 4136/6217 cut-off events. For 189347/189549 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 33473 event pairs, 1432 based on Foata normal form. 131/6271 useless extension candidates. Maximal degree in co-relation 43275. Up to 5669 conditions per place. [2024-06-14 14:45:22,126 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 367 selfloop transitions, 82 changer transitions 0/467 dead transitions. [2024-06-14 14:45:22,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 467 transitions, 6812 flow [2024-06-14 14:45:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:45:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:45:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-14 14:45:22,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-06-14 14:45:22,129 INFO L175 Difference]: Start difference. First operand has 156 places, 429 transitions, 5643 flow. Second operand 8 states and 158 transitions. [2024-06-14 14:45:22,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 467 transitions, 6812 flow [2024-06-14 14:45:22,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 467 transitions, 6775 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-14 14:45:22,332 INFO L231 Difference]: Finished difference. Result has 163 places, 436 transitions, 5927 flow [2024-06-14 14:45:22,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5606, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5927, PETRI_PLACES=163, PETRI_TRANSITIONS=436} [2024-06-14 14:45:22,333 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 118 predicate places. [2024-06-14 14:45:22,333 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 436 transitions, 5927 flow [2024-06-14 14:45:22,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:22,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:22,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:22,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:45:22,334 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-14 14:45:22,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:22,335 INFO L85 PathProgramCache]: Analyzing trace with hash 941230355, now seen corresponding path program 7 times [2024-06-14 14:45:22,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:22,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903632403] [2024-06-14 14:45:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:22,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903632403] [2024-06-14 14:45:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903632403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:45:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308436123] [2024-06-14 14:45:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:37,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:45:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:37,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:45:37,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:45:37,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:45:37,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 436 transitions, 5927 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:37,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:37,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:45:37,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:40,730 INFO L124 PetriNetUnfolderBase]: 3948/6033 cut-off events. [2024-06-14 14:45:40,730 INFO L125 PetriNetUnfolderBase]: For 180813/180855 co-relation queries the response was YES. [2024-06-14 14:45:40,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42628 conditions, 6033 events. 3948/6033 cut-off events. For 180813/180855 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 33747 event pairs, 896 based on Foata normal form. 19/6038 useless extension candidates. Maximal degree in co-relation 42551. Up to 4111 conditions per place. [2024-06-14 14:45:40,775 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 142 selfloop transitions, 343 changer transitions 0/496 dead transitions. [2024-06-14 14:45:40,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 496 transitions, 7534 flow [2024-06-14 14:45:40,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:45:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:45:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-06-14 14:45:40,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-06-14 14:45:40,778 INFO L175 Difference]: Start difference. First operand has 163 places, 436 transitions, 5927 flow. Second operand 9 states and 184 transitions. [2024-06-14 14:45:40,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 496 transitions, 7534 flow [2024-06-14 14:45:40,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 496 transitions, 7317 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 14:45:41,005 INFO L231 Difference]: Finished difference. Result has 166 places, 449 transitions, 6727 flow [2024-06-14 14:45:41,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5711, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6727, PETRI_PLACES=166, PETRI_TRANSITIONS=449} [2024-06-14 14:45:41,005 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 121 predicate places. [2024-06-14 14:45:41,005 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 449 transitions, 6727 flow [2024-06-14 14:45:41,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:45:41,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:41,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:45:41,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:45:41,006 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:45:41,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1861780251, now seen corresponding path program 2 times [2024-06-14 14:45:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511777179] [2024-06-14 14:45:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511777179] [2024-06-14 14:46:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511777179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:00,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:00,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:46:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104442431] [2024-06-14 14:46:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:00,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:46:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:00,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:46:00,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:46:00,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:46:00,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 449 transitions, 6727 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:00,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:00,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:46:00,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:02,928 INFO L124 PetriNetUnfolderBase]: 3833/5750 cut-off events. [2024-06-14 14:46:02,928 INFO L125 PetriNetUnfolderBase]: For 212213/212726 co-relation queries the response was YES. [2024-06-14 14:46:02,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43699 conditions, 5750 events. 3833/5750 cut-off events. For 212213/212726 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29976 event pairs, 1320 based on Foata normal form. 122/5769 useless extension candidates. Maximal degree in co-relation 43622. Up to 5383 conditions per place. [2024-06-14 14:46:02,971 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 414 selfloop transitions, 26 changer transitions 0/466 dead transitions. [2024-06-14 14:46:02,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 466 transitions, 7756 flow [2024-06-14 14:46:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:46:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:46:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-14 14:46:02,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-06-14 14:46:02,972 INFO L175 Difference]: Start difference. First operand has 166 places, 449 transitions, 6727 flow. Second operand 6 states and 117 transitions. [2024-06-14 14:46:02,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 466 transitions, 7756 flow [2024-06-14 14:46:03,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 466 transitions, 7021 flow, removed 80 selfloop flow, removed 7 redundant places. [2024-06-14 14:46:03,187 INFO L231 Difference]: Finished difference. Result has 165 places, 452 transitions, 6098 flow [2024-06-14 14:46:03,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5994, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6098, PETRI_PLACES=165, PETRI_TRANSITIONS=452} [2024-06-14 14:46:03,187 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 120 predicate places. [2024-06-14 14:46:03,187 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 452 transitions, 6098 flow [2024-06-14 14:46:03,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:03,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:03,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:46:03,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:46:03,188 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-14 14:46:03,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1406647653, now seen corresponding path program 3 times [2024-06-14 14:46:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730345671] [2024-06-14 14:46:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:18,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730345671] [2024-06-14 14:46:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730345671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:18,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:18,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:46:18,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475226230] [2024-06-14 14:46:18,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:18,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:46:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:46:18,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:46:18,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:46:18,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 452 transitions, 6098 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:18,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:18,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:46:18,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:21,455 INFO L124 PetriNetUnfolderBase]: 4241/6358 cut-off events. [2024-06-14 14:46:21,455 INFO L125 PetriNetUnfolderBase]: For 217324/217542 co-relation queries the response was YES. [2024-06-14 14:46:21,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45274 conditions, 6358 events. 4241/6358 cut-off events. For 217324/217542 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 34455 event pairs, 1652 based on Foata normal form. 144/6427 useless extension candidates. Maximal degree in co-relation 45197. Up to 5988 conditions per place. [2024-06-14 14:46:21,501 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 434 selfloop transitions, 27 changer transitions 0/480 dead transitions. [2024-06-14 14:46:21,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 480 transitions, 7180 flow [2024-06-14 14:46:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:46:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:46:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 14:46:21,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2024-06-14 14:46:21,504 INFO L175 Difference]: Start difference. First operand has 165 places, 452 transitions, 6098 flow. Second operand 8 states and 150 transitions. [2024-06-14 14:46:21,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 480 transitions, 7180 flow [2024-06-14 14:46:21,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 480 transitions, 7119 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-14 14:46:21,742 INFO L231 Difference]: Finished difference. Result has 169 places, 454 transitions, 6152 flow [2024-06-14 14:46:21,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6037, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6152, PETRI_PLACES=169, PETRI_TRANSITIONS=454} [2024-06-14 14:46:21,742 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 124 predicate places. [2024-06-14 14:46:21,743 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 454 transitions, 6152 flow [2024-06-14 14:46:21,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:21,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:21,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:46:21,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:46:21,743 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-14 14:46:21,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -250870369, now seen corresponding path program 1 times [2024-06-14 14:46:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113473837] [2024-06-14 14:46:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:40,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:40,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113473837] [2024-06-14 14:46:40,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113473837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:40,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:40,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:46:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904954527] [2024-06-14 14:46:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:40,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:46:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:40,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:46:40,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:46:41,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:46:41,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 454 transitions, 6152 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 14:46:41,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:41,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:46:41,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:43,610 INFO L124 PetriNetUnfolderBase]: 3873/5812 cut-off events. [2024-06-14 14:46:43,611 INFO L125 PetriNetUnfolderBase]: For 212038/212551 co-relation queries the response was YES. [2024-06-14 14:46:43,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42666 conditions, 5812 events. 3873/5812 cut-off events. For 212038/212551 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 30408 event pairs, 1324 based on Foata normal form. 124/5833 useless extension candidates. Maximal degree in co-relation 42589. Up to 5422 conditions per place. [2024-06-14 14:46:43,651 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 423 selfloop transitions, 33 changer transitions 0/482 dead transitions. [2024-06-14 14:46:43,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 482 transitions, 7272 flow [2024-06-14 14:46:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:46:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:46:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 14:46:43,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448051948051948 [2024-06-14 14:46:43,653 INFO L175 Difference]: Start difference. First operand has 169 places, 454 transitions, 6152 flow. Second operand 7 states and 137 transitions. [2024-06-14 14:46:43,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 482 transitions, 7272 flow [2024-06-14 14:46:43,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 482 transitions, 7191 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-14 14:46:43,864 INFO L231 Difference]: Finished difference. Result has 172 places, 463 transitions, 6255 flow [2024-06-14 14:46:43,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6071, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6255, PETRI_PLACES=172, PETRI_TRANSITIONS=463} [2024-06-14 14:46:43,865 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 127 predicate places. [2024-06-14 14:46:43,865 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 463 transitions, 6255 flow [2024-06-14 14:46:43,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 14:46:43,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:43,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:46:43,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:46:43,865 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:46:43,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:43,866 INFO L85 PathProgramCache]: Analyzing trace with hash 567949781, now seen corresponding path program 1 times [2024-06-14 14:46:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264771361] [2024-06-14 14:46:43,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:46:58,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264771361] [2024-06-14 14:46:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264771361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:46:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621484563] [2024-06-14 14:46:58,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:46:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:58,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:46:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:46:58,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:46:58,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 463 transitions, 6255 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:46:58,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:58,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:46:58,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:02,090 INFO L124 PetriNetUnfolderBase]: 4669/6946 cut-off events. [2024-06-14 14:47:02,091 INFO L125 PetriNetUnfolderBase]: For 218358/218372 co-relation queries the response was YES. [2024-06-14 14:47:02,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49362 conditions, 6946 events. 4669/6946 cut-off events. For 218358/218372 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36829 event pairs, 1856 based on Foata normal form. 2/6916 useless extension candidates. Maximal degree in co-relation 49283. Up to 6638 conditions per place. [2024-06-14 14:47:02,143 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 454 selfloop transitions, 42 changer transitions 0/504 dead transitions. [2024-06-14 14:47:02,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 504 transitions, 7570 flow [2024-06-14 14:47:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:47:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:47:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-14 14:47:02,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2024-06-14 14:47:02,147 INFO L175 Difference]: Start difference. First operand has 172 places, 463 transitions, 6255 flow. Second operand 8 states and 145 transitions. [2024-06-14 14:47:02,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 504 transitions, 7570 flow [2024-06-14 14:47:02,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 504 transitions, 7525 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-14 14:47:02,407 INFO L231 Difference]: Finished difference. Result has 178 places, 475 transitions, 6526 flow [2024-06-14 14:47:02,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6210, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6526, PETRI_PLACES=178, PETRI_TRANSITIONS=475} [2024-06-14 14:47:02,408 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 133 predicate places. [2024-06-14 14:47:02,408 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 475 transitions, 6526 flow [2024-06-14 14:47:02,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:02,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:02,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:47:02,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:47:02,409 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:47:02,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 567950091, now seen corresponding path program 4 times [2024-06-14 14:47:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:02,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309360441] [2024-06-14 14:47:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:16,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:16,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309360441] [2024-06-14 14:47:16,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309360441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:16,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:47:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59077084] [2024-06-14 14:47:16,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:16,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:47:16,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:16,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:47:16,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:47:17,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:47:17,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 475 transitions, 6526 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:17,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:17,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:47:17,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:20,077 INFO L124 PetriNetUnfolderBase]: 4321/6486 cut-off events. [2024-06-14 14:47:20,078 INFO L125 PetriNetUnfolderBase]: For 246709/246953 co-relation queries the response was YES. [2024-06-14 14:47:20,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47955 conditions, 6486 events. 4321/6486 cut-off events. For 246709/246953 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 35304 event pairs, 1665 based on Foata normal form. 154/6560 useless extension candidates. Maximal degree in co-relation 47873. Up to 6068 conditions per place. [2024-06-14 14:47:20,132 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 449 selfloop transitions, 34 changer transitions 0/504 dead transitions. [2024-06-14 14:47:20,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 504 transitions, 7668 flow [2024-06-14 14:47:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:47:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:47:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 14:47:20,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4289772727272727 [2024-06-14 14:47:20,135 INFO L175 Difference]: Start difference. First operand has 178 places, 475 transitions, 6526 flow. Second operand 8 states and 151 transitions. [2024-06-14 14:47:20,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 504 transitions, 7668 flow [2024-06-14 14:47:20,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 504 transitions, 7564 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 14:47:20,414 INFO L231 Difference]: Finished difference. Result has 180 places, 477 transitions, 6562 flow [2024-06-14 14:47:20,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6422, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6562, PETRI_PLACES=180, PETRI_TRANSITIONS=477} [2024-06-14 14:47:20,415 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 135 predicate places. [2024-06-14 14:47:20,415 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 477 transitions, 6562 flow [2024-06-14 14:47:20,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:20,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:20,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:47:20,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:47:20,416 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-14 14:47:20,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash 717956875, now seen corresponding path program 5 times [2024-06-14 14:47:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:20,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955602592] [2024-06-14 14:47:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:34,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955602592] [2024-06-14 14:47:34,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955602592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:34,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:34,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:47:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931236980] [2024-06-14 14:47:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:34,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:47:34,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:34,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:47:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:47:35,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:47:35,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 477 transitions, 6562 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:35,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:35,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:47:35,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:38,130 INFO L124 PetriNetUnfolderBase]: 4343/6521 cut-off events. [2024-06-14 14:47:38,131 INFO L125 PetriNetUnfolderBase]: For 261013/261247 co-relation queries the response was YES. [2024-06-14 14:47:38,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48788 conditions, 6521 events. 4343/6521 cut-off events. For 261013/261247 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 35470 event pairs, 1657 based on Foata normal form. 140/6588 useless extension candidates. Maximal degree in co-relation 48705. Up to 6132 conditions per place. [2024-06-14 14:47:38,181 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 464 selfloop transitions, 18 changer transitions 0/503 dead transitions. [2024-06-14 14:47:38,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 503 transitions, 7676 flow [2024-06-14 14:47:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:47:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:47:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 14:47:38,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2024-06-14 14:47:38,185 INFO L175 Difference]: Start difference. First operand has 180 places, 477 transitions, 6562 flow. Second operand 8 states and 150 transitions. [2024-06-14 14:47:38,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 503 transitions, 7676 flow [2024-06-14 14:47:38,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 503 transitions, 7568 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 14:47:38,481 INFO L231 Difference]: Finished difference. Result has 182 places, 479 transitions, 6561 flow [2024-06-14 14:47:38,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6454, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6561, PETRI_PLACES=182, PETRI_TRANSITIONS=479} [2024-06-14 14:47:38,482 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 137 predicate places. [2024-06-14 14:47:38,482 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 479 transitions, 6561 flow [2024-06-14 14:47:38,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:38,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:38,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:47:38,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:47:38,482 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:47:38,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 272730891, now seen corresponding path program 6 times [2024-06-14 14:47:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:38,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769637701] [2024-06-14 14:47:38,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:38,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:53,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:53,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769637701] [2024-06-14 14:47:53,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769637701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:53,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:53,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:47:53,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029899850] [2024-06-14 14:47:53,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:53,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:47:53,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:53,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:47:53,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:47:53,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:47:53,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 479 transitions, 6561 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:53,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:53,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:47:53,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:56,578 INFO L124 PetriNetUnfolderBase]: 4318/6484 cut-off events. [2024-06-14 14:47:56,579 INFO L125 PetriNetUnfolderBase]: For 274041/274290 co-relation queries the response was YES. [2024-06-14 14:47:56,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48776 conditions, 6484 events. 4318/6484 cut-off events. For 274041/274290 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 35301 event pairs, 1643 based on Foata normal form. 143/6553 useless extension candidates. Maximal degree in co-relation 48692. Up to 6066 conditions per place. [2024-06-14 14:47:56,630 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 450 selfloop transitions, 44 changer transitions 0/515 dead transitions. [2024-06-14 14:47:56,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 515 transitions, 7839 flow [2024-06-14 14:47:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:47:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:47:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 14:47:56,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346590909090909 [2024-06-14 14:47:56,636 INFO L175 Difference]: Start difference. First operand has 182 places, 479 transitions, 6561 flow. Second operand 8 states and 153 transitions. [2024-06-14 14:47:56,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 515 transitions, 7839 flow [2024-06-14 14:47:56,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 515 transitions, 7750 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-14 14:47:56,956 INFO L231 Difference]: Finished difference. Result has 185 places, 486 transitions, 6749 flow [2024-06-14 14:47:56,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6472, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6749, PETRI_PLACES=185, PETRI_TRANSITIONS=486} [2024-06-14 14:47:56,956 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 140 predicate places. [2024-06-14 14:47:56,956 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 486 transitions, 6749 flow [2024-06-14 14:47:56,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:56,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:56,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:47:56,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:47:56,957 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-14 14:47:56,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash 272484627, now seen corresponding path program 8 times [2024-06-14 14:47:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:56,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021344441] [2024-06-14 14:47:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:13,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021344441] [2024-06-14 14:48:13,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021344441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:13,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:13,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:48:13,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28897070] [2024-06-14 14:48:13,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:13,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:48:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:48:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:48:13,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:48:13,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 486 transitions, 6749 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:13,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:13,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:48:13,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:16,187 INFO L124 PetriNetUnfolderBase]: 4067/6200 cut-off events. [2024-06-14 14:48:16,187 INFO L125 PetriNetUnfolderBase]: For 261792/261819 co-relation queries the response was YES. [2024-06-14 14:48:16,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46749 conditions, 6200 events. 4067/6200 cut-off events. For 261792/261819 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 34659 event pairs, 1489 based on Foata normal form. 12/6172 useless extension candidates. Maximal degree in co-relation 46663. Up to 5569 conditions per place. [2024-06-14 14:48:16,240 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 430 selfloop transitions, 81 changer transitions 0/524 dead transitions. [2024-06-14 14:48:16,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 524 transitions, 7954 flow [2024-06-14 14:48:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:48:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:48:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-14 14:48:16,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-06-14 14:48:16,243 INFO L175 Difference]: Start difference. First operand has 185 places, 486 transitions, 6749 flow. Second operand 9 states and 170 transitions. [2024-06-14 14:48:16,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 524 transitions, 7954 flow [2024-06-14 14:48:16,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 524 transitions, 7665 flow, removed 104 selfloop flow, removed 5 redundant places. [2024-06-14 14:48:16,604 INFO L231 Difference]: Finished difference. Result has 189 places, 486 transitions, 6640 flow [2024-06-14 14:48:16,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6460, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6640, PETRI_PLACES=189, PETRI_TRANSITIONS=486} [2024-06-14 14:48:16,604 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 144 predicate places. [2024-06-14 14:48:16,605 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 486 transitions, 6640 flow [2024-06-14 14:48:16,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:16,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:16,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:48:16,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:48:16,605 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:48:16,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1972550585, now seen corresponding path program 3 times [2024-06-14 14:48:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920544673] [2024-06-14 14:48:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920544673] [2024-06-14 14:48:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920544673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:34,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:34,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:48:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343086982] [2024-06-14 14:48:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:34,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:48:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:48:34,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:48:34,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:48:34,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 486 transitions, 6640 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:34,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:34,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:48:34,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:36,577 INFO L124 PetriNetUnfolderBase]: 3950/5891 cut-off events. [2024-06-14 14:48:36,577 INFO L125 PetriNetUnfolderBase]: For 283079/283645 co-relation queries the response was YES. [2024-06-14 14:48:36,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46094 conditions, 5891 events. 3950/5891 cut-off events. For 283079/283645 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 30486 event pairs, 1450 based on Foata normal form. 142/5914 useless extension candidates. Maximal degree in co-relation 46007. Up to 5570 conditions per place. [2024-06-14 14:48:36,623 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 454 selfloop transitions, 12 changer transitions 0/494 dead transitions. [2024-06-14 14:48:36,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 494 transitions, 7598 flow [2024-06-14 14:48:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:48:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:48:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-14 14:48:36,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 14:48:36,624 INFO L175 Difference]: Start difference. First operand has 189 places, 486 transitions, 6640 flow. Second operand 6 states and 108 transitions. [2024-06-14 14:48:36,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 494 transitions, 7598 flow [2024-06-14 14:48:36,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 494 transitions, 7133 flow, removed 28 selfloop flow, removed 9 redundant places. [2024-06-14 14:48:36,912 INFO L231 Difference]: Finished difference. Result has 186 places, 486 transitions, 6205 flow [2024-06-14 14:48:36,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6175, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6205, PETRI_PLACES=186, PETRI_TRANSITIONS=486} [2024-06-14 14:48:36,912 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 141 predicate places. [2024-06-14 14:48:36,913 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 486 transitions, 6205 flow [2024-06-14 14:48:36,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:36,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:36,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:48:36,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:48:36,913 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:48:36,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1523554521, now seen corresponding path program 1 times [2024-06-14 14:48:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:36,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069752808] [2024-06-14 14:48:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:36,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:57,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069752808] [2024-06-14 14:48:57,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069752808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:57,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:57,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:48:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381456529] [2024-06-14 14:48:57,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:57,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:48:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:48:57,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:48:58,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:48:58,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 486 transitions, 6205 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:58,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:58,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:48:58,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:00,794 INFO L124 PetriNetUnfolderBase]: 4467/6630 cut-off events. [2024-06-14 14:49:00,794 INFO L125 PetriNetUnfolderBase]: For 276555/276782 co-relation queries the response was YES. [2024-06-14 14:49:00,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49103 conditions, 6630 events. 4467/6630 cut-off events. For 276555/276782 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 35075 event pairs, 1773 based on Foata normal form. 146/6732 useless extension candidates. Maximal degree in co-relation 49015. Up to 6404 conditions per place. [2024-06-14 14:49:00,843 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 471 selfloop transitions, 17 changer transitions 0/504 dead transitions. [2024-06-14 14:49:00,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 504 transitions, 7349 flow [2024-06-14 14:49:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:49:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:49:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-14 14:49:00,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-14 14:49:00,844 INFO L175 Difference]: Start difference. First operand has 186 places, 486 transitions, 6205 flow. Second operand 6 states and 109 transitions. [2024-06-14 14:49:00,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 504 transitions, 7349 flow [2024-06-14 14:49:01,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 504 transitions, 7296 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 14:49:01,165 INFO L231 Difference]: Finished difference. Result has 187 places, 492 transitions, 6252 flow [2024-06-14 14:49:01,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6154, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6252, PETRI_PLACES=187, PETRI_TRANSITIONS=492} [2024-06-14 14:49:01,166 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 142 predicate places. [2024-06-14 14:49:01,166 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 492 transitions, 6252 flow [2024-06-14 14:49:01,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:01,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:01,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:49:01,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:49:01,167 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:49:01,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1987751931, now seen corresponding path program 2 times [2024-06-14 14:49:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:01,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674352397] [2024-06-14 14:49:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674352397] [2024-06-14 14:49:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674352397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:22,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:49:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001694086] [2024-06-14 14:49:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:22,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:49:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:49:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:49:22,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:49:22,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 492 transitions, 6252 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:22,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:22,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:49:22,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:25,402 INFO L124 PetriNetUnfolderBase]: 4464/6626 cut-off events. [2024-06-14 14:49:25,403 INFO L125 PetriNetUnfolderBase]: For 275587/275816 co-relation queries the response was YES. [2024-06-14 14:49:25,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49460 conditions, 6626 events. 4464/6626 cut-off events. For 275587/275816 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 35073 event pairs, 1789 based on Foata normal form. 148/6729 useless extension candidates. Maximal degree in co-relation 49371. Up to 6401 conditions per place. [2024-06-14 14:49:25,453 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 467 selfloop transitions, 17 changer transitions 0/500 dead transitions. [2024-06-14 14:49:25,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 500 transitions, 7246 flow [2024-06-14 14:49:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:49:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:49:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-14 14:49:25,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 14:49:25,454 INFO L175 Difference]: Start difference. First operand has 187 places, 492 transitions, 6252 flow. Second operand 6 states and 105 transitions. [2024-06-14 14:49:25,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 500 transitions, 7246 flow [2024-06-14 14:49:25,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 500 transitions, 7199 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-14 14:49:25,776 INFO L231 Difference]: Finished difference. Result has 191 places, 492 transitions, 6245 flow [2024-06-14 14:49:25,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6205, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6245, PETRI_PLACES=191, PETRI_TRANSITIONS=492} [2024-06-14 14:49:25,776 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 146 predicate places. [2024-06-14 14:49:25,776 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 492 transitions, 6245 flow [2024-06-14 14:49:25,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:25,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:25,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:49:25,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:49:25,777 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-14 14:49:25,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1821613112, now seen corresponding path program 1 times [2024-06-14 14:49:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798702563] [2024-06-14 14:49:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798702563] [2024-06-14 14:49:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798702563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:43,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:49:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693948160] [2024-06-14 14:49:43,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:43,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:49:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:49:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:49:43,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:49:43,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 492 transitions, 6245 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:43,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:43,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:49:43,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:46,760 INFO L124 PetriNetUnfolderBase]: 4239/6467 cut-off events. [2024-06-14 14:49:46,760 INFO L125 PetriNetUnfolderBase]: For 281016/281039 co-relation queries the response was YES. [2024-06-14 14:49:46,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48434 conditions, 6467 events. 4239/6467 cut-off events. For 281016/281039 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 36577 event pairs, 1294 based on Foata normal form. 16/6439 useless extension candidates. Maximal degree in co-relation 48343. Up to 5739 conditions per place. [2024-06-14 14:49:46,814 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 461 selfloop transitions, 112 changer transitions 0/590 dead transitions. [2024-06-14 14:49:46,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 590 transitions, 8241 flow [2024-06-14 14:49:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 14:49:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 14:49:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 254 transitions. [2024-06-14 14:49:46,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44405594405594406 [2024-06-14 14:49:46,817 INFO L175 Difference]: Start difference. First operand has 191 places, 492 transitions, 6245 flow. Second operand 13 states and 254 transitions. [2024-06-14 14:49:46,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 590 transitions, 8241 flow [2024-06-14 14:49:47,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 590 transitions, 8195 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 14:49:47,166 INFO L231 Difference]: Finished difference. Result has 202 places, 532 transitions, 7038 flow [2024-06-14 14:49:47,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6199, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7038, PETRI_PLACES=202, PETRI_TRANSITIONS=532} [2024-06-14 14:49:47,166 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 157 predicate places. [2024-06-14 14:49:47,166 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 532 transitions, 7038 flow [2024-06-14 14:49:47,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:47,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:47,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:49:47,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:49:47,167 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-14 14:49:47,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:47,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1941130990, now seen corresponding path program 2 times [2024-06-14 14:49:47,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134435802] [2024-06-14 14:49:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134435802] [2024-06-14 14:50:05,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134435802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:05,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:05,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:50:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156624372] [2024-06-14 14:50:05,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:05,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:50:05,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:05,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:50:05,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:50:06,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:50:06,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 532 transitions, 7038 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:06,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:06,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:50:06,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:09,693 INFO L124 PetriNetUnfolderBase]: 4432/6765 cut-off events. [2024-06-14 14:50:09,693 INFO L125 PetriNetUnfolderBase]: For 306619/306638 co-relation queries the response was YES. [2024-06-14 14:50:09,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52814 conditions, 6765 events. 4432/6765 cut-off events. For 306619/306638 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 38696 event pairs, 1325 based on Foata normal form. 14/6728 useless extension candidates. Maximal degree in co-relation 52719. Up to 6035 conditions per place. [2024-06-14 14:50:09,750 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 495 selfloop transitions, 124 changer transitions 0/636 dead transitions. [2024-06-14 14:50:09,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 636 transitions, 9364 flow [2024-06-14 14:50:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:50:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:50:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-14 14:50:09,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412878787878788 [2024-06-14 14:50:09,753 INFO L175 Difference]: Start difference. First operand has 202 places, 532 transitions, 7038 flow. Second operand 12 states and 233 transitions. [2024-06-14 14:50:09,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 636 transitions, 9364 flow [2024-06-14 14:50:10,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 636 transitions, 9090 flow, removed 86 selfloop flow, removed 6 redundant places. [2024-06-14 14:50:10,154 INFO L231 Difference]: Finished difference. Result has 213 places, 586 transitions, 8061 flow [2024-06-14 14:50:10,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6874, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8061, PETRI_PLACES=213, PETRI_TRANSITIONS=586} [2024-06-14 14:50:10,155 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 168 predicate places. [2024-06-14 14:50:10,155 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 586 transitions, 8061 flow [2024-06-14 14:50:10,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:10,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:10,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:10,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:50:10,155 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:50:10,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1082217168, now seen corresponding path program 3 times [2024-06-14 14:50:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700692069] [2024-06-14 14:50:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:28,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700692069] [2024-06-14 14:50:28,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700692069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:28,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:28,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:50:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060203374] [2024-06-14 14:50:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:28,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:50:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:28,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:50:28,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:50:28,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:50:28,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 586 transitions, 8061 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:28,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:28,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:50:28,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:32,455 INFO L124 PetriNetUnfolderBase]: 4708/7160 cut-off events. [2024-06-14 14:50:32,455 INFO L125 PetriNetUnfolderBase]: For 340019/340052 co-relation queries the response was YES. [2024-06-14 14:50:32,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57369 conditions, 7160 events. 4708/7160 cut-off events. For 340019/340052 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 41330 event pairs, 1402 based on Foata normal form. 24/7130 useless extension candidates. Maximal degree in co-relation 57267. Up to 6357 conditions per place. [2024-06-14 14:50:32,526 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 517 selfloop transitions, 153 changer transitions 0/687 dead transitions. [2024-06-14 14:50:32,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 687 transitions, 10615 flow [2024-06-14 14:50:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:50:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:50:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2024-06-14 14:50:32,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-06-14 14:50:32,529 INFO L175 Difference]: Start difference. First operand has 213 places, 586 transitions, 8061 flow. Second operand 12 states and 237 transitions. [2024-06-14 14:50:32,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 687 transitions, 10615 flow [2024-06-14 14:50:32,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 687 transitions, 10248 flow, removed 119 selfloop flow, removed 4 redundant places. [2024-06-14 14:50:33,008 INFO L231 Difference]: Finished difference. Result has 225 places, 635 transitions, 9040 flow [2024-06-14 14:50:33,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7829, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9040, PETRI_PLACES=225, PETRI_TRANSITIONS=635} [2024-06-14 14:50:33,009 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 180 predicate places. [2024-06-14 14:50:33,009 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 635 transitions, 9040 flow [2024-06-14 14:50:33,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:33,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:33,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:33,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:50:33,010 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:50:33,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2135230660, now seen corresponding path program 4 times [2024-06-14 14:50:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:33,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674933761] [2024-06-14 14:50:33,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:50:48,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:48,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674933761] [2024-06-14 14:50:48,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674933761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:48,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:48,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:50:48,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123128018] [2024-06-14 14:50:48,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:48,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:50:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:48,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:50:48,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:50:48,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:50:48,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 635 transitions, 9040 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:48,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:48,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:50:48,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:52,836 INFO L124 PetriNetUnfolderBase]: 4917/7508 cut-off events. [2024-06-14 14:50:52,836 INFO L125 PetriNetUnfolderBase]: For 378569/378599 co-relation queries the response was YES. [2024-06-14 14:50:52,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61551 conditions, 7508 events. 4917/7508 cut-off events. For 378569/378599 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 44193 event pairs, 1297 based on Foata normal form. 18/7474 useless extension candidates. Maximal degree in co-relation 61444. Up to 6417 conditions per place. [2024-06-14 14:50:52,915 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 536 selfloop transitions, 219 changer transitions 0/772 dead transitions. [2024-06-14 14:50:52,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 772 transitions, 12442 flow [2024-06-14 14:50:52,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:50:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:50:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 240 transitions. [2024-06-14 14:50:52,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:50:52,921 INFO L175 Difference]: Start difference. First operand has 225 places, 635 transitions, 9040 flow. Second operand 12 states and 240 transitions. [2024-06-14 14:50:52,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 772 transitions, 12442 flow [2024-06-14 14:50:53,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 772 transitions, 12144 flow, removed 131 selfloop flow, removed 4 redundant places. [2024-06-14 14:50:53,537 INFO L231 Difference]: Finished difference. Result has 236 places, 719 transitions, 10872 flow [2024-06-14 14:50:53,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8924, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10872, PETRI_PLACES=236, PETRI_TRANSITIONS=719} [2024-06-14 14:50:53,539 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 191 predicate places. [2024-06-14 14:50:53,539 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 719 transitions, 10872 flow [2024-06-14 14:50:53,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:53,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:53,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:50:53,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:50:53,540 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:50:53,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1821703322, now seen corresponding path program 5 times [2024-06-14 14:50:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:53,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840382861] [2024-06-14 14:50:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:51:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:51:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:51:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840382861] [2024-06-14 14:51:11,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840382861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:51:11,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:51:11,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:51:11,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882713968] [2024-06-14 14:51:11,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:51:11,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:51:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:51:11,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:51:11,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:51:11,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:51:11,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 719 transitions, 10872 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:11,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:51:11,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:51:11,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:51:15,671 INFO L124 PetriNetUnfolderBase]: 4982/7606 cut-off events. [2024-06-14 14:51:15,671 INFO L125 PetriNetUnfolderBase]: For 402952/402981 co-relation queries the response was YES. [2024-06-14 14:51:15,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65023 conditions, 7606 events. 4982/7606 cut-off events. For 402952/402981 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 44762 event pairs, 1380 based on Foata normal form. 22/7578 useless extension candidates. Maximal degree in co-relation 64911. Up to 6722 conditions per place. [2024-06-14 14:51:15,741 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 588 selfloop transitions, 190 changer transitions 0/795 dead transitions. [2024-06-14 14:51:15,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 795 transitions, 13241 flow [2024-06-14 14:51:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 14:51:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 14:51:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 248 transitions. [2024-06-14 14:51:15,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43356643356643354 [2024-06-14 14:51:15,745 INFO L175 Difference]: Start difference. First operand has 236 places, 719 transitions, 10872 flow. Second operand 13 states and 248 transitions. [2024-06-14 14:51:15,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 795 transitions, 13241 flow [2024-06-14 14:51:16,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 795 transitions, 12993 flow, removed 68 selfloop flow, removed 6 redundant places. [2024-06-14 14:51:16,474 INFO L231 Difference]: Finished difference. Result has 243 places, 744 transitions, 11621 flow [2024-06-14 14:51:16,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=10648, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11621, PETRI_PLACES=243, PETRI_TRANSITIONS=744} [2024-06-14 14:51:16,475 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 198 predicate places. [2024-06-14 14:51:16,475 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 744 transitions, 11621 flow [2024-06-14 14:51:16,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:51:16,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:51:16,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:51:16,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:51:16,476 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-14 14:51:16,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:51:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -967198488, now seen corresponding path program 6 times [2024-06-14 14:51:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:51:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148662867] [2024-06-14 14:51:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:51:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:51:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15