./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.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/mix011_power.oepc_pso.oepc_rmo.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/mix011_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix011_power.oepc_pso.oepc_rmo.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:36:33,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:36:33,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:36:33,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:36:33,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:36:33,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:36:33,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:36:33,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:36:33,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:36:33,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:36:33,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:36:33,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:36:33,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:36:33,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:36:33,246 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:36:33,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:36:33,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:36:33,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:36:33,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:36:33,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:36:33,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:36:33,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:36:33,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:36:33,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:36:33,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:36:33,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:36:33,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:36:33,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:36:33,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:36:33,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:36:33,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:36:33,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:36:33,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:36:33,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:36:33,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:36:33,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:36:33,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:36:33,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:36:33,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:36:33,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:36:33,252 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:36:33,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:36:33,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:36:33,252 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:36:33,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:36:33,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:36:33,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:36:33,461 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:36:33,463 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:36:33,464 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/mix011_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-14 14:36:33,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:36:33,704 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:36:33,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 14:36:34,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:36:35,071 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:36:35,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 14:36:35,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6edb31fe/eb68aaf8a8524c19b8c93bf1a41bf1cc/FLAG58e2bfc6c [2024-06-14 14:36:35,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6edb31fe/eb68aaf8a8524c19b8c93bf1a41bf1cc [2024-06-14 14:36:35,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:36:35,092 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:36:35,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:36:35,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:36:35,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:36:35,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:36:33" (1/2) ... [2024-06-14 14:36:35,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff09b2e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:36:35, skipping insertion in model container [2024-06-14 14:36:35,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:36:33" (1/2) ... [2024-06-14 14:36:35,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f2cc213 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:36:35, skipping insertion in model container [2024-06-14 14:36:35,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:36:35" (2/2) ... [2024-06-14 14:36:35,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff09b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35, skipping insertion in model container [2024-06-14 14:36:35,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:36:35" (2/2) ... [2024-06-14 14:36:35,100 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:36:35,182 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:36:35,183 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_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_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_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_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! 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 && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) [2024-06-14 14:36:35,183 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_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_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_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_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! 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 && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) [2024-06-14 14:36:35,184 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_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_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_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_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! 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 && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) [2024-06-14 14:36:35,184 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:36:35,185 INFO L106 edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1; [2024-06-14 14:36:35,219 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:36:35,563 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:36:35,574 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:36:35,935 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:36:35,967 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:36:35,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35 WrapperNode [2024-06-14 14:36:35,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:36:35,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:36:35,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:36:35,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:36:35,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,122 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-06-14 14:36:36,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:36:36,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:36:36,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:36:36,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:36:36,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,210 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:36:36,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:36:36,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:36:36,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:36:36,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:36:36,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (1/1) ... [2024-06-14 14:36:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:36:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:36:36,314 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:36:36,334 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:36:36,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:36:36,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:36:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:36:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:36:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:36:36,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:36:36,456 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 14:36:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 14:36:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:36:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:36:36,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:36:36,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:36:36,458 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:36:36,590 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:36:36,592 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:36:37,976 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:36:37,978 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:36:38,311 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:36:38,311 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:36:38,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:36:38 BoogieIcfgContainer [2024-06-14 14:36:38,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:36:38,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:36:38,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:36:38,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:36:38,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:36:33" (1/4) ... [2024-06-14 14:36:38,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430bc42c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:36:38, skipping insertion in model container [2024-06-14 14:36:38,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:36:35" (2/4) ... [2024-06-14 14:36:38,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430bc42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:36:38, skipping insertion in model container [2024-06-14 14:36:38,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:36:35" (3/4) ... [2024-06-14 14:36:38,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430bc42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:36:38, skipping insertion in model container [2024-06-14 14:36:38,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:36:38" (4/4) ... [2024-06-14 14:36:38,321 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 14:36:38,335 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:36:38,336 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 14:36:38,336 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:36:38,467 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:36:38,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow [2024-06-14 14:36:38,579 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-06-14 14:36:38,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:36:38,585 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 4. Compared 68 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:36:38,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow [2024-06-14 14:36:38,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow [2024-06-14 14:36:38,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:36:38,633 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;@6ac56d99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:36:38,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 14:36:38,642 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:36:38,656 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 14:36:38,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:36:38,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:38,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:36:38,657 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:36:38,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash -969480644, now seen corresponding path program 1 times [2024-06-14 14:36:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221667546] [2024-06-14 14:36:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:38,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:46,889 INFO 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:36:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221667546] [2024-06-14 14:36:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221667546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:46,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:46,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:36:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834289744] [2024-06-14 14:36:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:46,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:36:46,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:46,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:36:46,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:36:47,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:36:47,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:36:47,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:47,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:36:47,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:48,251 INFO L124 PetriNetUnfolderBase]: 1659/2576 cut-off events. [2024-06-14 14:36:48,252 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-14 14:36:48,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 2576 events. 1659/2576 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12911 event pairs, 1184 based on Foata normal form. 1/2507 useless extension candidates. Maximal degree in co-relation 5127. Up to 2465 conditions per place. [2024-06-14 14:36:48,269 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 35 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-14 14:36:48,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 183 flow [2024-06-14 14:36:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:36:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:36:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-06-14 14:36:48,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-06-14 14:36:48,281 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 78 transitions. [2024-06-14 14:36:48,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 183 flow [2024-06-14 14:36:48,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 14:36:48,287 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow [2024-06-14 14:36:48,289 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:36:48,292 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-06-14 14:36:48,293 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow [2024-06-14 14:36:48,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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:36:48,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:48,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:48,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:36:48,294 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:36:48,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash 337041307, now seen corresponding path program 1 times [2024-06-14 14:36:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:48,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251460496] [2024-06-14 14:36:48,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:48,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:54,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:54,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251460496] [2024-06-14 14:36:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251460496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:54,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:54,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:36:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380088850] [2024-06-14 14:36:54,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:54,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:36:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:36:54,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:36:54,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:36:54,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:36:54,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:54,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:36:54,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:55,786 INFO L124 PetriNetUnfolderBase]: 1653/2577 cut-off events. [2024-06-14 14:36:55,786 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2024-06-14 14:36:55,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5768 conditions, 2577 events. 1653/2577 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12997 event pairs, 1038 based on Foata normal form. 3/2553 useless extension candidates. Maximal degree in co-relation 5753. Up to 2441 conditions per place. [2024-06-14 14:36:55,800 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 42 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-06-14 14:36:55,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 250 flow [2024-06-14 14:36:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:36:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:36:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-06-14 14:36:55,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-06-14 14:36:55,802 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 100 transitions. [2024-06-14 14:36:55,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 250 flow [2024-06-14 14:36:55,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:36:55,804 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow [2024-06-14 14:36:55,804 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:36:55,805 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-14 14:36:55,805 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow [2024-06-14 14:36:55,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:36:55,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:55,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:55,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:36:55,806 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:36:55,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:55,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1858347141, now seen corresponding path program 1 times [2024-06-14 14:36:55,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:55,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835399771] [2024-06-14 14:36:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:55,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:01,573 INFO 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:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835399771] [2024-06-14 14:37:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835399771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:01,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:37:01,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329395936] [2024-06-14 14:37:01,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:01,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:37:01,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:01,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:37:01,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:37:01,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:37:01,739 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:01,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:01,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:37:01,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:02,919 INFO L124 PetriNetUnfolderBase]: 1661/2603 cut-off events. [2024-06-14 14:37:02,919 INFO L125 PetriNetUnfolderBase]: For 1388/1388 co-relation queries the response was YES. [2024-06-14 14:37:02,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 2603 events. 1661/2603 cut-off events. For 1388/1388 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13188 event pairs, 812 based on Foata normal form. 5/2584 useless extension candidates. Maximal degree in co-relation 6414. Up to 2387 conditions per place. [2024-06-14 14:37:02,936 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 55 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2024-06-14 14:37:02,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 404 flow [2024-06-14 14:37:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:37:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:37:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-06-14 14:37:02,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-06-14 14:37:02,938 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 130 transitions. [2024-06-14 14:37:02,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 404 flow [2024-06-14 14:37:02,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 390 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 14:37:02,940 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 241 flow [2024-06-14 14:37:02,940 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2024-06-14 14:37:02,941 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2024-06-14 14:37:02,941 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 241 flow [2024-06-14 14:37:02,941 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:02,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:02,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:02,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:37:02,942 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:02,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1774187770, now seen corresponding path program 1 times [2024-06-14 14:37:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:02,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926431929] [2024-06-14 14:37:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:10,269 INFO 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:10,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926431929] [2024-06-14 14:37:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926431929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:37:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759891850] [2024-06-14 14:37:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:10,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:37:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:10,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:37:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:37:10,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:37:10,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 241 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:10,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:10,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:37:10,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:11,885 INFO L124 PetriNetUnfolderBase]: 1669/2615 cut-off events. [2024-06-14 14:37:11,885 INFO L125 PetriNetUnfolderBase]: For 3180/3183 co-relation queries the response was YES. [2024-06-14 14:37:11,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7550 conditions, 2615 events. 1669/2615 cut-off events. For 3180/3183 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13270 event pairs, 666 based on Foata normal form. 7/2598 useless extension candidates. Maximal degree in co-relation 7530. Up to 2373 conditions per place. [2024-06-14 14:37:11,899 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 62 selfloop transitions, 20 changer transitions 0/88 dead transitions. [2024-06-14 14:37:11,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 531 flow [2024-06-14 14:37:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:37:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:37:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-06-14 14:37:11,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2024-06-14 14:37:11,903 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 241 flow. Second operand 6 states and 153 transitions. [2024-06-14 14:37:11,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 531 flow [2024-06-14 14:37:11,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 523 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-14 14:37:11,910 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 314 flow [2024-06-14 14:37:11,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-06-14 14:37:11,911 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-06-14 14:37:11,912 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 314 flow [2024-06-14 14:37:11,912 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:11,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:11,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:11,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:37:11,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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:11,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash -834752700, now seen corresponding path program 1 times [2024-06-14 14:37:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631009270] [2024-06-14 14:37:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:19,251 INFO 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:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631009270] [2024-06-14 14:37:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631009270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:37:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001872065] [2024-06-14 14:37:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:19,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:37:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:19,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:37:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:37:19,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-14 14:37:19,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:19,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:19,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-14 14:37:19,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:20,946 INFO L124 PetriNetUnfolderBase]: 1681/2635 cut-off events. [2024-06-14 14:37:20,947 INFO L125 PetriNetUnfolderBase]: For 5024/5027 co-relation queries the response was YES. [2024-06-14 14:37:20,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8421 conditions, 2635 events. 1681/2635 cut-off events. For 5024/5027 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13372 event pairs, 502 based on Foata normal form. 12/2623 useless extension candidates. Maximal degree in co-relation 8398. Up to 2341 conditions per place. [2024-06-14 14:37:20,963 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 66 selfloop transitions, 23 changer transitions 0/95 dead transitions. [2024-06-14 14:37:20,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 632 flow [2024-06-14 14:37:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:37:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:37:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-06-14 14:37:20,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2024-06-14 14:37:20,966 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 314 flow. Second operand 7 states and 172 transitions. [2024-06-14 14:37:20,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 632 flow [2024-06-14 14:37:20,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 95 transitions, 583 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:37:20,972 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 341 flow [2024-06-14 14:37:20,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-06-14 14:37:20,975 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-06-14 14:37:20,975 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 341 flow [2024-06-14 14:37:20,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:37:20,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:20,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:20,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:37:20,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:37:20,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1527270789, now seen corresponding path program 1 times [2024-06-14 14:37:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:20,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718260934] [2024-06-14 14:37:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:37:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718260934] [2024-06-14 14:37:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718260934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:34,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:34,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:37:34,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717716875] [2024-06-14 14:37:34,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:34,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:37:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:34,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:37:34,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:37:35,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:37:35,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 341 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:37:35,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:35,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:37:35,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:36,418 INFO L124 PetriNetUnfolderBase]: 1676/2622 cut-off events. [2024-06-14 14:37:36,418 INFO L125 PetriNetUnfolderBase]: For 6848/6848 co-relation queries the response was YES. [2024-06-14 14:37:36,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8941 conditions, 2622 events. 1676/2622 cut-off events. For 6848/6848 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13277 event pairs, 659 based on Foata normal form. 2/2600 useless extension candidates. Maximal degree in co-relation 8917. Up to 2484 conditions per place. [2024-06-14 14:37:36,440 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 55 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2024-06-14 14:37:36,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 495 flow [2024-06-14 14:37:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:37:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:37:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-06-14 14:37:36,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2024-06-14 14:37:36,441 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 341 flow. Second operand 5 states and 102 transitions. [2024-06-14 14:37:36,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 495 flow [2024-06-14 14:37:36,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 431 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-14 14:37:36,445 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 301 flow [2024-06-14 14:37:36,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-06-14 14:37:36,447 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-06-14 14:37:36,448 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 301 flow [2024-06-14 14:37:36,448 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:37:36,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:36,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:36,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:37:36,448 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:37:36,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash -112774731, now seen corresponding path program 1 times [2024-06-14 14:37:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:36,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015253583] [2024-06-14 14:37:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:37:51,088 INFO 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:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:37:51,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015253583] [2024-06-14 14:37:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015253583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:37:51,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:37:51,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:37:51,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007469016] [2024-06-14 14:37:51,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:37:51,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:37:51,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:37:51,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:37:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:37:51,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:37:51,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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:51,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:37:51,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:37:51,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:37:52,713 INFO L124 PetriNetUnfolderBase]: 1967/3062 cut-off events. [2024-06-14 14:37:52,713 INFO L125 PetriNetUnfolderBase]: For 9000/9000 co-relation queries the response was YES. [2024-06-14 14:37:52,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10287 conditions, 3062 events. 1967/3062 cut-off events. For 9000/9000 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15354 event pairs, 795 based on Foata normal form. 2/3061 useless extension candidates. Maximal degree in co-relation 10261. Up to 2896 conditions per place. [2024-06-14 14:37:52,726 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 60 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-06-14 14:37:52,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 501 flow [2024-06-14 14:37:52,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:37:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:37:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-14 14:37:52,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-06-14 14:37:52,728 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 301 flow. Second operand 6 states and 115 transitions. [2024-06-14 14:37:52,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 501 flow [2024-06-14 14:37:52,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 479 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:37:52,732 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 335 flow [2024-06-14 14:37:52,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-06-14 14:37:52,733 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-06-14 14:37:52,733 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 335 flow [2024-06-14 14:37:52,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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:52,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:37:52,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:37:52,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:37:52,734 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:37:52,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:37:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash -584068164, now seen corresponding path program 1 times [2024-06-14 14:37:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:37:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598507188] [2024-06-14 14:37:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:37:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:37:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:03,881 INFO 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:03,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:03,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598507188] [2024-06-14 14:38:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598507188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:03,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:03,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:38:03,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656098] [2024-06-14 14:38:03,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:03,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:38:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:03,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:38:03,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:38:04,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:38:04,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 335 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:04,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:04,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:38:04,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:05,328 INFO L124 PetriNetUnfolderBase]: 1856/2951 cut-off events. [2024-06-14 14:38:05,328 INFO L125 PetriNetUnfolderBase]: For 11476/11482 co-relation queries the response was YES. [2024-06-14 14:38:05,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10568 conditions, 2951 events. 1856/2951 cut-off events. For 11476/11482 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15263 event pairs, 727 based on Foata normal form. 8/2955 useless extension candidates. Maximal degree in co-relation 10542. Up to 2663 conditions per place. [2024-06-14 14:38:05,343 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 58 selfloop transitions, 19 changer transitions 0/84 dead transitions. [2024-06-14 14:38:05,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 589 flow [2024-06-14 14:38:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:38:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:38:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-06-14 14:38:05,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2024-06-14 14:38:05,363 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 335 flow. Second operand 6 states and 129 transitions. [2024-06-14 14:38:05,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 589 flow [2024-06-14 14:38:05,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 557 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 14:38:05,372 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 375 flow [2024-06-14 14:38:05,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-06-14 14:38:05,374 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2024-06-14 14:38:05,374 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 375 flow [2024-06-14 14:38:05,374 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:05,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:05,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:05,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:38:05,374 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:05,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1171629722, now seen corresponding path program 2 times [2024-06-14 14:38:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036954960] [2024-06-14 14:38:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:16,519 INFO 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:16,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:16,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036954960] [2024-06-14 14:38:16,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036954960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:16,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:16,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:38:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217865414] [2024-06-14 14:38:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:38:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:38:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:38:16,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:38:16,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 375 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:16,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:16,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:38:16,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:18,018 INFO L124 PetriNetUnfolderBase]: 1841/2925 cut-off events. [2024-06-14 14:38:18,018 INFO L125 PetriNetUnfolderBase]: For 13354/13354 co-relation queries the response was YES. [2024-06-14 14:38:18,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10801 conditions, 2925 events. 1841/2925 cut-off events. For 13354/13354 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15100 event pairs, 723 based on Foata normal form. 2/2924 useless extension candidates. Maximal degree in co-relation 10774. Up to 2704 conditions per place. [2024-06-14 14:38:18,032 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 61 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2024-06-14 14:38:18,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 557 flow [2024-06-14 14:38:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:38:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:38:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-14 14:38:18,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:38:18,034 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 375 flow. Second operand 6 states and 120 transitions. [2024-06-14 14:38:18,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 557 flow [2024-06-14 14:38:18,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 79 transitions, 528 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:38:18,040 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 376 flow [2024-06-14 14:38:18,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2024-06-14 14:38:18,040 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-06-14 14:38:18,041 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 376 flow [2024-06-14 14:38:18,041 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:18,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:18,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:18,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:38:18,041 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:38:18,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1159125438, now seen corresponding path program 1 times [2024-06-14 14:38:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:18,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457140110] [2024-06-14 14:38:18,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:38:33,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:33,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457140110] [2024-06-14 14:38:33,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457140110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:33,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:33,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:38:33,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297738608] [2024-06-14 14:38:33,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:33,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:38:33,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:33,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:38:33,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:38:34,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:38:34,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 376 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:38:34,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:34,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:38:34,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:35,524 INFO L124 PetriNetUnfolderBase]: 1948/3011 cut-off events. [2024-06-14 14:38:35,525 INFO L125 PetriNetUnfolderBase]: For 15615/15615 co-relation queries the response was YES. [2024-06-14 14:38:35,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11345 conditions, 3011 events. 1948/3011 cut-off events. For 15615/15615 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14930 event pairs, 753 based on Foata normal form. 4/3012 useless extension candidates. Maximal degree in co-relation 11317. Up to 2848 conditions per place. [2024-06-14 14:38:35,538 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 68 selfloop transitions, 14 changer transitions 0/87 dead transitions. [2024-06-14 14:38:35,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 614 flow [2024-06-14 14:38:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:38:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:38:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-14 14:38:35,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 14:38:35,540 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 376 flow. Second operand 7 states and 133 transitions. [2024-06-14 14:38:35,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 614 flow [2024-06-14 14:38:35,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 567 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 14:38:35,546 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 395 flow [2024-06-14 14:38:35,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-06-14 14:38:35,548 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-06-14 14:38:35,548 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 395 flow [2024-06-14 14:38:35,548 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:38:35,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:35,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:35,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:38:35,549 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:38:35,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1179660042, now seen corresponding path program 1 times [2024-06-14 14:38:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:35,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685464405] [2024-06-14 14:38:35,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:38:47,993 INFO 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:47,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:38:47,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685464405] [2024-06-14 14:38:47,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685464405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:38:47,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:38:47,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:38:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127564449] [2024-06-14 14:38:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:38:47,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:38:47,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:38:47,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:38:47,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:38:48,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:38:48,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 395 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:38:48,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:38:48,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:38:48,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:38:49,721 INFO L124 PetriNetUnfolderBase]: 1970/3078 cut-off events. [2024-06-14 14:38:49,721 INFO L125 PetriNetUnfolderBase]: For 18542/18548 co-relation queries the response was YES. [2024-06-14 14:38:49,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12101 conditions, 3078 events. 1970/3078 cut-off events. For 18542/18548 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15546 event pairs, 736 based on Foata normal form. 8/3082 useless extension candidates. Maximal degree in co-relation 12072. Up to 2770 conditions per place. [2024-06-14 14:38:49,737 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 71 selfloop transitions, 27 changer transitions 0/103 dead transitions. [2024-06-14 14:38:49,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 103 transitions, 761 flow [2024-06-14 14:38:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:38:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:38:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-14 14:38:49,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:38:49,739 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 395 flow. Second operand 8 states and 160 transitions. [2024-06-14 14:38:49,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 103 transitions, 761 flow [2024-06-14 14:38:49,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 719 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 14:38:49,748 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 478 flow [2024-06-14 14:38:49,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=478, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2024-06-14 14:38:49,749 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2024-06-14 14:38:49,749 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 478 flow [2024-06-14 14:38:49,749 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:38:49,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:38:49,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:38:49,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:38:49,749 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:38:49,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:38:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1961021746, now seen corresponding path program 2 times [2024-06-14 14:38:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:38:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122127390] [2024-06-14 14:38:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:38:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:38:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:02,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:02,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122127390] [2024-06-14 14:39:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122127390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:02,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:39:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439029194] [2024-06-14 14:39:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:02,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:39:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:39:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:39:02,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:39:02,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 478 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:02,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:02,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:39:02,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:04,318 INFO L124 PetriNetUnfolderBase]: 1981/3093 cut-off events. [2024-06-14 14:39:04,318 INFO L125 PetriNetUnfolderBase]: For 22310/22310 co-relation queries the response was YES. [2024-06-14 14:39:04,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12971 conditions, 3093 events. 1981/3093 cut-off events. For 22310/22310 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15578 event pairs, 732 based on Foata normal form. 2/3092 useless extension candidates. Maximal degree in co-relation 12941. Up to 2905 conditions per place. [2024-06-14 14:39:04,333 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 77 selfloop transitions, 14 changer transitions 0/96 dead transitions. [2024-06-14 14:39:04,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 740 flow [2024-06-14 14:39:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:39:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:39:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 14:39:04,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 14:39:04,336 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 478 flow. Second operand 7 states and 132 transitions. [2024-06-14 14:39:04,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 96 transitions, 740 flow [2024-06-14 14:39:04,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 700 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 14:39:04,350 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 512 flow [2024-06-14 14:39:04,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=512, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2024-06-14 14:39:04,351 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-06-14 14:39:04,351 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 512 flow [2024-06-14 14:39:04,351 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:04,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:04,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:04,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:39:04,352 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:04,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash -921600688, now seen corresponding path program 3 times [2024-06-14 14:39:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:04,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336169347] [2024-06-14 14:39:04,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:04,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:18,009 INFO 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:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336169347] [2024-06-14 14:39:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336169347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:18,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:39:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849537368] [2024-06-14 14:39:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:18,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:39:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:39:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:39:18,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:39:18,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 512 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:18,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:18,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:39:18,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:19,779 INFO L124 PetriNetUnfolderBase]: 1976/3086 cut-off events. [2024-06-14 14:39:19,780 INFO L125 PetriNetUnfolderBase]: For 25857/25857 co-relation queries the response was YES. [2024-06-14 14:39:19,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13337 conditions, 3086 events. 1976/3086 cut-off events. For 25857/25857 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15557 event pairs, 732 based on Foata normal form. 2/3085 useless extension candidates. Maximal degree in co-relation 13305. Up to 2880 conditions per place. [2024-06-14 14:39:19,796 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 78 selfloop transitions, 20 changer transitions 0/103 dead transitions. [2024-06-14 14:39:19,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 103 transitions, 804 flow [2024-06-14 14:39:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:39:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:39:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 14:39:19,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2024-06-14 14:39:19,798 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 512 flow. Second operand 8 states and 150 transitions. [2024-06-14 14:39:19,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 103 transitions, 804 flow [2024-06-14 14:39:19,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 758 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-14 14:39:19,811 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 558 flow [2024-06-14 14:39:19,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2024-06-14 14:39:19,812 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2024-06-14 14:39:19,812 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 558 flow [2024-06-14 14:39:19,812 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:19,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:19,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:19,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:39:19,813 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:39:19,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2047315953, now seen corresponding path program 1 times [2024-06-14 14:39:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636709151] [2024-06-14 14:39:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:39:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636709151] [2024-06-14 14:39:36,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636709151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:36,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:39:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790363917] [2024-06-14 14:39:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:36,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:39:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:36,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:39:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:39:36,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:39:36,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 558 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:36,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:36,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:39:36,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:38,288 INFO L124 PetriNetUnfolderBase]: 2486/3721 cut-off events. [2024-06-14 14:39:38,288 INFO L125 PetriNetUnfolderBase]: For 38873/38873 co-relation queries the response was YES. [2024-06-14 14:39:38,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16894 conditions, 3721 events. 2486/3721 cut-off events. For 38873/38873 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17912 event pairs, 990 based on Foata normal form. 1/3719 useless extension candidates. Maximal degree in co-relation 16861. Up to 3628 conditions per place. [2024-06-14 14:39:38,304 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 74 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2024-06-14 14:39:38,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 91 transitions, 766 flow [2024-06-14 14:39:38,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:39:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:39:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-14 14:39:38,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 14:39:38,306 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 558 flow. Second operand 5 states and 90 transitions. [2024-06-14 14:39:38,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 91 transitions, 766 flow [2024-06-14 14:39:38,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 702 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 14:39:38,359 INFO L231 Difference]: Finished difference. Result has 77 places, 83 transitions, 546 flow [2024-06-14 14:39:38,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=72, 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=546, PETRI_PLACES=77, PETRI_TRANSITIONS=83} [2024-06-14 14:39:38,361 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2024-06-14 14:39:38,361 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 83 transitions, 546 flow [2024-06-14 14:39:38,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:38,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:38,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:38,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:39:38,362 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:39:38,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1347445595, now seen corresponding path program 1 times [2024-06-14 14:39:38,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:38,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985319201] [2024-06-14 14:39:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:39:52,145 INFO 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,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:39:52,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985319201] [2024-06-14 14:39:52,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985319201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:39:52,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:39:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:39:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151646063] [2024-06-14 14:39:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:39:52,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:39:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:39:52,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:39:52,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:39:52,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:39:52,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 83 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:52,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:39:52,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:39:52,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:39:53,889 INFO L124 PetriNetUnfolderBase]: 1980/3103 cut-off events. [2024-06-14 14:39:53,889 INFO L125 PetriNetUnfolderBase]: For 38496/38499 co-relation queries the response was YES. [2024-06-14 14:39:53,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14885 conditions, 3103 events. 1980/3103 cut-off events. For 38496/38499 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15945 event pairs, 720 based on Foata normal form. 4/3103 useless extension candidates. Maximal degree in co-relation 14851. Up to 2733 conditions per place. [2024-06-14 14:39:53,905 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 78 selfloop transitions, 26 changer transitions 0/116 dead transitions. [2024-06-14 14:39:53,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 936 flow [2024-06-14 14:39:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:39:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:39:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-14 14:39:53,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487012987012987 [2024-06-14 14:39:53,909 INFO L175 Difference]: Start difference. First operand has 77 places, 83 transitions, 546 flow. Second operand 7 states and 150 transitions. [2024-06-14 14:39:53,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 936 flow [2024-06-14 14:39:53,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 116 transitions, 906 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 14:39:53,940 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 642 flow [2024-06-14 14:39:53,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=642, PETRI_PLACES=81, PETRI_TRANSITIONS=89} [2024-06-14 14:39:53,941 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2024-06-14 14:39:53,941 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 642 flow [2024-06-14 14:39:53,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:39:53,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:39:53,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:39:53,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:39:53,944 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:39:53,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:39:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2081520953, now seen corresponding path program 2 times [2024-06-14 14:39:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:39:53,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145573099] [2024-06-14 14:39:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:39:53,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:39:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:07,212 INFO 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:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145573099] [2024-06-14 14:40:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145573099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:07,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:07,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:40:07,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111507428] [2024-06-14 14:40:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:07,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:40:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:40:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:40:07,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:40:07,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 89 transitions, 642 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:07,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:07,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:40:07,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:08,970 INFO L124 PetriNetUnfolderBase]: 1975/3096 cut-off events. [2024-06-14 14:40:08,970 INFO L125 PetriNetUnfolderBase]: For 43822/43825 co-relation queries the response was YES. [2024-06-14 14:40:08,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15560 conditions, 3096 events. 1975/3096 cut-off events. For 43822/43825 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15921 event pairs, 720 based on Foata normal form. 4/3096 useless extension candidates. Maximal degree in co-relation 15525. Up to 2761 conditions per place. [2024-06-14 14:40:08,986 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 77 selfloop transitions, 22 changer transitions 0/111 dead transitions. [2024-06-14 14:40:08,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 896 flow [2024-06-14 14:40:08,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:40:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:40:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-14 14:40:08,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707792207792208 [2024-06-14 14:40:08,992 INFO L175 Difference]: Start difference. First operand has 81 places, 89 transitions, 642 flow. Second operand 7 states and 145 transitions. [2024-06-14 14:40:08,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 896 flow [2024-06-14 14:40:09,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 111 transitions, 835 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-14 14:40:09,011 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 633 flow [2024-06-14 14:40:09,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=633, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2024-06-14 14:40:09,012 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-06-14 14:40:09,012 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 633 flow [2024-06-14 14:40:09,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:40:09,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:09,014 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:09,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:40:09,014 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:40:09,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1351255030, now seen corresponding path program 1 times [2024-06-14 14:40:09,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:09,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334581486] [2024-06-14 14:40:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:09,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:22,159 INFO 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:22,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:22,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334581486] [2024-06-14 14:40:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334581486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:22,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:22,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:40:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084253192] [2024-06-14 14:40:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:22,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:40:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:40:22,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:40:22,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:40:22,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 633 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:22,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:22,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:40:22,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:24,032 INFO L124 PetriNetUnfolderBase]: 2089/3215 cut-off events. [2024-06-14 14:40:24,032 INFO L125 PetriNetUnfolderBase]: For 48652/48655 co-relation queries the response was YES. [2024-06-14 14:40:24,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16434 conditions, 3215 events. 2089/3215 cut-off events. For 48652/48655 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16160 event pairs, 761 based on Foata normal form. 4/3215 useless extension candidates. Maximal degree in co-relation 16397. Up to 2891 conditions per place. [2024-06-14 14:40:24,051 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 80 selfloop transitions, 37 changer transitions 0/123 dead transitions. [2024-06-14 14:40:24,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 123 transitions, 1045 flow [2024-06-14 14:40:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:40:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:40:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-06-14 14:40:24,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630681818181818 [2024-06-14 14:40:24,054 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 633 flow. Second operand 8 states and 163 transitions. [2024-06-14 14:40:24,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 123 transitions, 1045 flow [2024-06-14 14:40:24,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 123 transitions, 990 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 14:40:24,075 INFO L231 Difference]: Finished difference. Result has 87 places, 92 transitions, 698 flow [2024-06-14 14:40:24,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=698, PETRI_PLACES=87, PETRI_TRANSITIONS=92} [2024-06-14 14:40:24,076 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2024-06-14 14:40:24,076 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 698 flow [2024-06-14 14:40:24,076 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:24,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:24,077 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:24,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:40:24,077 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:40:24,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:24,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2085245975, now seen corresponding path program 1 times [2024-06-14 14:40:24,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:24,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679607367] [2024-06-14 14:40:24,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:40:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:36,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679607367] [2024-06-14 14:40:36,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679607367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:36,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:36,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:40:36,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635138490] [2024-06-14 14:40:36,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:36,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:40:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:36,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:40:36,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:40:36,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:40:36,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 92 transitions, 698 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:36,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:36,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:40:36,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:38,638 INFO L124 PetriNetUnfolderBase]: 2173/3338 cut-off events. [2024-06-14 14:40:38,638 INFO L125 PetriNetUnfolderBase]: For 55252/55255 co-relation queries the response was YES. [2024-06-14 14:40:38,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17403 conditions, 3338 events. 2173/3338 cut-off events. For 55252/55255 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16803 event pairs, 677 based on Foata normal form. 10/3344 useless extension candidates. Maximal degree in co-relation 17365. Up to 2875 conditions per place. [2024-06-14 14:40:38,657 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 92 selfloop transitions, 39 changer transitions 0/137 dead transitions. [2024-06-14 14:40:38,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 137 transitions, 1204 flow [2024-06-14 14:40:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:40:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:40:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-14 14:40:38,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2024-06-14 14:40:38,660 INFO L175 Difference]: Start difference. First operand has 87 places, 92 transitions, 698 flow. Second operand 9 states and 182 transitions. [2024-06-14 14:40:38,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 137 transitions, 1204 flow [2024-06-14 14:40:38,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 1100 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 14:40:38,683 INFO L231 Difference]: Finished difference. Result has 91 places, 102 transitions, 783 flow [2024-06-14 14:40:38,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=783, PETRI_PLACES=91, PETRI_TRANSITIONS=102} [2024-06-14 14:40:38,683 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2024-06-14 14:40:38,684 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 102 transitions, 783 flow [2024-06-14 14:40:38,684 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:38,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:38,684 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:38,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:40:38,684 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:40:38,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:38,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1351260610, now seen corresponding path program 2 times [2024-06-14 14:40:38,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:38,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218765691] [2024-06-14 14:40:38,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:38,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:40:50,852 INFO 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,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:40:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218765691] [2024-06-14 14:40:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218765691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:40:50,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:40:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:40:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760492953] [2024-06-14 14:40:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:40:50,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:40:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:40:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:40:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:40:51,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:40:51,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 102 transitions, 783 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:51,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:40:51,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:40:51,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:40:52,750 INFO L124 PetriNetUnfolderBase]: 2184/3359 cut-off events. [2024-06-14 14:40:52,751 INFO L125 PetriNetUnfolderBase]: For 61832/61835 co-relation queries the response was YES. [2024-06-14 14:40:52,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18515 conditions, 3359 events. 2184/3359 cut-off events. For 61832/61835 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16910 event pairs, 711 based on Foata normal form. 4/3359 useless extension candidates. Maximal degree in co-relation 18475. Up to 3021 conditions per place. [2024-06-14 14:40:52,769 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 90 selfloop transitions, 37 changer transitions 0/133 dead transitions. [2024-06-14 14:40:52,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 133 transitions, 1219 flow [2024-06-14 14:40:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:40:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:40:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-14 14:40:52,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45170454545454547 [2024-06-14 14:40:52,773 INFO L175 Difference]: Start difference. First operand has 91 places, 102 transitions, 783 flow. Second operand 8 states and 159 transitions. [2024-06-14 14:40:52,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 133 transitions, 1219 flow [2024-06-14 14:40:52,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 133 transitions, 1166 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 14:40:52,802 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 855 flow [2024-06-14 14:40:52,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=855, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2024-06-14 14:40:52,802 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places. [2024-06-14 14:40:52,803 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 855 flow [2024-06-14 14:40:52,803 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:52,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:40:52,803 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,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:40:52,803 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:40:52,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:40:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 654983538, now seen corresponding path program 3 times [2024-06-14 14:40:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:40:52,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181004461] [2024-06-14 14:40:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:40:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:40:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:04,860 INFO 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:04,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181004461] [2024-06-14 14:41:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181004461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:04,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:04,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:41:04,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320470748] [2024-06-14 14:41:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:04,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:41:04,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:04,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:41:04,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:41:05,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:41:05,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 855 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:41:05,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:05,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:41:05,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:06,909 INFO L124 PetriNetUnfolderBase]: 2179/3352 cut-off events. [2024-06-14 14:41:06,909 INFO L125 PetriNetUnfolderBase]: For 67216/67219 co-relation queries the response was YES. [2024-06-14 14:41:06,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18755 conditions, 3352 events. 2179/3352 cut-off events. For 67216/67219 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16859 event pairs, 711 based on Foata normal form. 4/3352 useless extension candidates. Maximal degree in co-relation 18713. Up to 3137 conditions per place. [2024-06-14 14:41:06,938 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 102 selfloop transitions, 16 changer transitions 0/124 dead transitions. [2024-06-14 14:41:06,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 124 transitions, 1139 flow [2024-06-14 14:41:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:41:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:41:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-14 14:41:06,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 14:41:06,942 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 855 flow. Second operand 7 states and 133 transitions. [2024-06-14 14:41:06,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 124 transitions, 1139 flow [2024-06-14 14:41:06,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 124 transitions, 1039 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 14:41:06,989 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 795 flow [2024-06-14 14:41:06,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=795, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2024-06-14 14:41:06,990 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 52 predicate places. [2024-06-14 14:41:06,990 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 795 flow [2024-06-14 14:41:06,990 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:41:06,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:06,991 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:06,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:41:06,991 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:41:06,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash 654781945, now seen corresponding path program 2 times [2024-06-14 14:41:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312705423] [2024-06-14 14:41:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:20,080 INFO 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:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312705423] [2024-06-14 14:41:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312705423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:20,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:20,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:41:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197311999] [2024-06-14 14:41:20,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:20,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:41:20,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:20,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:41:20,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:41:20,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:41:20,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 795 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:20,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:20,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:41:20,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:22,146 INFO L124 PetriNetUnfolderBase]: 2201/3383 cut-off events. [2024-06-14 14:41:22,146 INFO L125 PetriNetUnfolderBase]: For 73755/73755 co-relation queries the response was YES. [2024-06-14 14:41:22,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19113 conditions, 3383 events. 2201/3383 cut-off events. For 73755/73755 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16982 event pairs, 707 based on Foata normal form. 4/3384 useless extension candidates. Maximal degree in co-relation 19070. Up to 3104 conditions per place. [2024-06-14 14:41:22,170 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 109 selfloop transitions, 27 changer transitions 0/142 dead transitions. [2024-06-14 14:41:22,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 142 transitions, 1309 flow [2024-06-14 14:41:22,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:41:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:41:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-14 14:41:22,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43686868686868685 [2024-06-14 14:41:22,175 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 795 flow. Second operand 9 states and 173 transitions. [2024-06-14 14:41:22,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 142 transitions, 1309 flow [2024-06-14 14:41:22,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 142 transitions, 1244 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 14:41:22,205 INFO L231 Difference]: Finished difference. Result has 99 places, 111 transitions, 882 flow [2024-06-14 14:41:22,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=882, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2024-06-14 14:41:22,206 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places. [2024-06-14 14:41:22,206 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 882 flow [2024-06-14 14:41:22,206 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:22,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:22,207 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:22,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:41:22,207 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:41:22,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1005992937, now seen corresponding path program 3 times [2024-06-14 14:41:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:22,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464249906] [2024-06-14 14:41:22,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:34,529 INFO 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:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464249906] [2024-06-14 14:41:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464249906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:41:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682019559] [2024-06-14 14:41:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:34,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:41:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:34,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:41:34,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:41:34,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:41:34,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 882 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:34,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:34,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:41:34,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:36,525 INFO L124 PetriNetUnfolderBase]: 2223/3420 cut-off events. [2024-06-14 14:41:36,526 INFO L125 PetriNetUnfolderBase]: For 81567/81567 co-relation queries the response was YES. [2024-06-14 14:41:36,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19805 conditions, 3420 events. 2223/3420 cut-off events. For 81567/81567 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17223 event pairs, 707 based on Foata normal form. 4/3421 useless extension candidates. Maximal degree in co-relation 19761. Up to 3192 conditions per place. [2024-06-14 14:41:36,543 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 115 selfloop transitions, 17 changer transitions 0/138 dead transitions. [2024-06-14 14:41:36,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 138 transitions, 1256 flow [2024-06-14 14:41:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:41:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:41:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 14:41:36,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2024-06-14 14:41:36,547 INFO L175 Difference]: Start difference. First operand has 99 places, 111 transitions, 882 flow. Second operand 8 states and 150 transitions. [2024-06-14 14:41:36,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 138 transitions, 1256 flow [2024-06-14 14:41:36,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 138 transitions, 1204 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 14:41:36,580 INFO L231 Difference]: Finished difference. Result has 102 places, 114 transitions, 926 flow [2024-06-14 14:41:36,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=926, PETRI_PLACES=102, PETRI_TRANSITIONS=114} [2024-06-14 14:41:36,581 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 57 predicate places. [2024-06-14 14:41:36,581 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 114 transitions, 926 flow [2024-06-14 14:41:36,581 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:36,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:36,581 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:36,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:41:36,582 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:41:36,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1522792063, now seen corresponding path program 4 times [2024-06-14 14:41:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:36,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68128928] [2024-06-14 14:41:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:41:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:41:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:41:48,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68128928] [2024-06-14 14:41:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68128928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:41:48,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:41:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:41:48,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474058563] [2024-06-14 14:41:48,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:41:48,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:41:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:41:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:41:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:41:49,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:41:49,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 114 transitions, 926 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:49,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:41:49,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:41:49,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:41:50,797 INFO L124 PetriNetUnfolderBase]: 2213/3406 cut-off events. [2024-06-14 14:41:50,798 INFO L125 PetriNetUnfolderBase]: For 86981/86981 co-relation queries the response was YES. [2024-06-14 14:41:50,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19936 conditions, 3406 events. 2213/3406 cut-off events. For 86981/86981 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17159 event pairs, 705 based on Foata normal form. 4/3407 useless extension candidates. Maximal degree in co-relation 19890. Up to 3151 conditions per place. [2024-06-14 14:41:50,820 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 111 selfloop transitions, 22 changer transitions 0/139 dead transitions. [2024-06-14 14:41:50,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 139 transitions, 1258 flow [2024-06-14 14:41:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:41:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:41:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 14:41:50,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346590909090909 [2024-06-14 14:41:50,836 INFO L175 Difference]: Start difference. First operand has 102 places, 114 transitions, 926 flow. Second operand 8 states and 153 transitions. [2024-06-14 14:41:50,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 139 transitions, 1258 flow [2024-06-14 14:41:50,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 139 transitions, 1172 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 14:41:50,892 INFO L231 Difference]: Finished difference. Result has 104 places, 114 transitions, 892 flow [2024-06-14 14:41:50,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=892, PETRI_PLACES=104, PETRI_TRANSITIONS=114} [2024-06-14 14:41:50,893 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2024-06-14 14:41:50,893 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 892 flow [2024-06-14 14:41:50,893 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:50,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:41:50,894 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:50,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:41:50,894 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:41:50,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:41:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1006871277, now seen corresponding path program 1 times [2024-06-14 14:41:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:41:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193496155] [2024-06-14 14:41:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:41:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:41:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:09,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:42:09,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:09,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193496155] [2024-06-14 14:42:09,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193496155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:09,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:09,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:42:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261440316] [2024-06-14 14:42:09,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:09,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:42:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:09,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:42:09,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:42:09,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:42:09,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 892 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:42:09,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:09,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:42:09,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:11,153 INFO L124 PetriNetUnfolderBase]: 2636/3947 cut-off events. [2024-06-14 14:42:11,154 INFO L125 PetriNetUnfolderBase]: For 104896/104896 co-relation queries the response was YES. [2024-06-14 14:42:11,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22980 conditions, 3947 events. 2636/3947 cut-off events. For 104896/104896 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 18906 event pairs, 906 based on Foata normal form. 3/3947 useless extension candidates. Maximal degree in co-relation 22933. Up to 3840 conditions per place. [2024-06-14 14:42:11,187 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 106 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2024-06-14 14:42:11,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 1180 flow [2024-06-14 14:42:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:42:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:42:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-14 14:42:11,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 14:42:11,189 INFO L175 Difference]: Start difference. First operand has 104 places, 114 transitions, 892 flow. Second operand 6 states and 105 transitions. [2024-06-14 14:42:11,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 1180 flow [2024-06-14 14:42:11,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 128 transitions, 1110 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:42:11,246 INFO L231 Difference]: Finished difference. Result has 103 places, 117 transitions, 884 flow [2024-06-14 14:42:11,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=884, PETRI_PLACES=103, PETRI_TRANSITIONS=117} [2024-06-14 14:42:11,247 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places. [2024-06-14 14:42:11,247 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 117 transitions, 884 flow [2024-06-14 14:42:11,247 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:42:11,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:11,247 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:11,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:42:11,248 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:42:11,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1178918507, now seen corresponding path program 1 times [2024-06-14 14:42:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153395433] [2024-06-14 14:42:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:11,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:27,037 INFO 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:27,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153395433] [2024-06-14 14:42:27,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153395433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:27,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:27,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:42:27,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309354116] [2024-06-14 14:42:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:27,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:42:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:42:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:42:27,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:42:27,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 117 transitions, 884 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:27,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:27,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:42:27,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:29,018 INFO L124 PetriNetUnfolderBase]: 2112/3313 cut-off events. [2024-06-14 14:42:29,018 INFO L125 PetriNetUnfolderBase]: For 98126/98129 co-relation queries the response was YES. [2024-06-14 14:42:29,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20192 conditions, 3313 events. 2112/3313 cut-off events. For 98126/98129 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17162 event pairs, 488 based on Foata normal form. 6/3315 useless extension candidates. Maximal degree in co-relation 20144. Up to 2819 conditions per place. [2024-06-14 14:42:29,040 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 108 selfloop transitions, 32 changer transitions 0/154 dead transitions. [2024-06-14 14:42:29,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 154 transitions, 1402 flow [2024-06-14 14:42:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:42:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:42:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-14 14:42:29,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48011363636363635 [2024-06-14 14:42:29,043 INFO L175 Difference]: Start difference. First operand has 103 places, 117 transitions, 884 flow. Second operand 8 states and 169 transitions. [2024-06-14 14:42:29,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 154 transitions, 1402 flow [2024-06-14 14:42:29,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 154 transitions, 1362 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 14:42:29,095 INFO L231 Difference]: Finished difference. Result has 107 places, 121 transitions, 983 flow [2024-06-14 14:42:29,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=983, PETRI_PLACES=107, PETRI_TRANSITIONS=121} [2024-06-14 14:42:29,096 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 62 predicate places. [2024-06-14 14:42:29,096 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 121 transitions, 983 flow [2024-06-14 14:42:29,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:29,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:29,096 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:29,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:42:29,097 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:42:29,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2140824749, now seen corresponding path program 1 times [2024-06-14 14:42:29,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:29,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251457943] [2024-06-14 14:42:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:42,720 INFO 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:42,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251457943] [2024-06-14 14:42:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251457943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:42,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:42,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:42:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362300647] [2024-06-14 14:42:42,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:42,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:42:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:42:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:42:43,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:42:43,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 983 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:42:43,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:43,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:42:43,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:42:44,690 INFO L124 PetriNetUnfolderBase]: 2237/3445 cut-off events. [2024-06-14 14:42:44,690 INFO L125 PetriNetUnfolderBase]: For 105661/105664 co-relation queries the response was YES. [2024-06-14 14:42:44,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21313 conditions, 3445 events. 2237/3445 cut-off events. For 105661/105664 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17373 event pairs, 653 based on Foata normal form. 4/3445 useless extension candidates. Maximal degree in co-relation 21264. Up to 3015 conditions per place. [2024-06-14 14:42:44,711 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 110 selfloop transitions, 46 changer transitions 0/162 dead transitions. [2024-06-14 14:42:44,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 162 transitions, 1551 flow [2024-06-14 14:42:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:42:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:42:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-14 14:42:44,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 14:42:44,715 INFO L175 Difference]: Start difference. First operand has 107 places, 121 transitions, 983 flow. Second operand 9 states and 180 transitions. [2024-06-14 14:42:44,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 162 transitions, 1551 flow [2024-06-14 14:42:44,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 162 transitions, 1481 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 14:42:44,775 INFO L231 Difference]: Finished difference. Result has 112 places, 127 transitions, 1091 flow [2024-06-14 14:42:44,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1091, PETRI_PLACES=112, PETRI_TRANSITIONS=127} [2024-06-14 14:42:44,776 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 67 predicate places. [2024-06-14 14:42:44,776 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 127 transitions, 1091 flow [2024-06-14 14:42:44,776 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:42:44,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:42:44,776 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:44,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:42:44,776 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:42:44,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:42:44,777 INFO L85 PathProgramCache]: Analyzing trace with hash 99845051, now seen corresponding path program 2 times [2024-06-14 14:42:44,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:42:44,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534600698] [2024-06-14 14:42:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:42:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:42:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:42:59,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:42:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:42:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534600698] [2024-06-14 14:42:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534600698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:42:59,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:42:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:42:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265967074] [2024-06-14 14:42:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:42:59,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:42:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:42:59,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:42:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:42:59,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-14 14:42:59,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 127 transitions, 1091 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:42:59,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:42:59,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-14 14:42:59,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:01,673 INFO L124 PetriNetUnfolderBase]: 2123/3327 cut-off events. [2024-06-14 14:43:01,673 INFO L125 PetriNetUnfolderBase]: For 113965/113968 co-relation queries the response was YES. [2024-06-14 14:43:01,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21311 conditions, 3327 events. 2123/3327 cut-off events. For 113965/113968 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17216 event pairs, 621 based on Foata normal form. 6/3329 useless extension candidates. Maximal degree in co-relation 21260. Up to 2900 conditions per place. [2024-06-14 14:43:01,716 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 114 selfloop transitions, 31 changer transitions 0/161 dead transitions. [2024-06-14 14:43:01,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 161 transitions, 1467 flow [2024-06-14 14:43:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:43:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:43:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2024-06-14 14:43:01,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671717171717172 [2024-06-14 14:43:01,720 INFO L175 Difference]: Start difference. First operand has 112 places, 127 transitions, 1091 flow. Second operand 9 states and 185 transitions. [2024-06-14 14:43:01,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 161 transitions, 1467 flow [2024-06-14 14:43:01,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 161 transitions, 1376 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-14 14:43:01,774 INFO L231 Difference]: Finished difference. Result has 116 places, 127 transitions, 1070 flow [2024-06-14 14:43:01,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1070, PETRI_PLACES=116, PETRI_TRANSITIONS=127} [2024-06-14 14:43:01,775 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 71 predicate places. [2024-06-14 14:43:01,775 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 127 transitions, 1070 flow [2024-06-14 14:43:01,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:43:01,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:01,776 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:01,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:43:01,776 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:43:01,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 213468855, now seen corresponding path program 2 times [2024-06-14 14:43:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:01,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592568580] [2024-06-14 14:43:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:43:17,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:17,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592568580] [2024-06-14 14:43:17,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592568580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:17,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:43:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936407509] [2024-06-14 14:43:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:17,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:43:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:17,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:43:17,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:43:17,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:43:17,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 127 transitions, 1070 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:43:17,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:17,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:43:17,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:19,304 INFO L124 PetriNetUnfolderBase]: 2240/3449 cut-off events. [2024-06-14 14:43:19,304 INFO L125 PetriNetUnfolderBase]: For 121185/121188 co-relation queries the response was YES. [2024-06-14 14:43:19,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22256 conditions, 3449 events. 2240/3449 cut-off events. For 121185/121188 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17426 event pairs, 651 based on Foata normal form. 4/3449 useless extension candidates. Maximal degree in co-relation 22203. Up to 3097 conditions per place. [2024-06-14 14:43:19,327 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 114 selfloop transitions, 40 changer transitions 0/160 dead transitions. [2024-06-14 14:43:19,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 160 transitions, 1488 flow [2024-06-14 14:43:19,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:43:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:43:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 14:43:19,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44191919191919193 [2024-06-14 14:43:19,331 INFO L175 Difference]: Start difference. First operand has 116 places, 127 transitions, 1070 flow. Second operand 9 states and 175 transitions. [2024-06-14 14:43:19,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 160 transitions, 1488 flow [2024-06-14 14:43:19,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 160 transitions, 1418 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 14:43:19,387 INFO L231 Difference]: Finished difference. Result has 117 places, 130 transitions, 1128 flow [2024-06-14 14:43:19,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1128, PETRI_PLACES=117, PETRI_TRANSITIONS=130} [2024-06-14 14:43:19,388 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 72 predicate places. [2024-06-14 14:43:19,388 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 130 transitions, 1128 flow [2024-06-14 14:43:19,388 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:43:19,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:19,388 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:19,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:43:19,389 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:43:19,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash 102641685, now seen corresponding path program 3 times [2024-06-14 14:43:19,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:19,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591235626] [2024-06-14 14:43:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:19,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:33,630 INFO 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:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591235626] [2024-06-14 14:43:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591235626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:33,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:43:33,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93488484] [2024-06-14 14:43:33,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:33,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:43:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:33,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:43:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:43:33,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:43:33,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 130 transitions, 1128 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:43:33,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:33,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:43:33,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:35,720 INFO L124 PetriNetUnfolderBase]: 2251/3463 cut-off events. [2024-06-14 14:43:35,720 INFO L125 PetriNetUnfolderBase]: For 129406/129409 co-relation queries the response was YES. [2024-06-14 14:43:35,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22667 conditions, 3463 events. 2251/3463 cut-off events. For 129406/129409 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17467 event pairs, 651 based on Foata normal form. 4/3463 useless extension candidates. Maximal degree in co-relation 22613. Up to 3095 conditions per place. [2024-06-14 14:43:35,742 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 112 selfloop transitions, 45 changer transitions 0/163 dead transitions. [2024-06-14 14:43:35,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 163 transitions, 1558 flow [2024-06-14 14:43:35,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:43:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:43:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-14 14:43:35,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 14:43:35,746 INFO L175 Difference]: Start difference. First operand has 117 places, 130 transitions, 1128 flow. Second operand 9 states and 176 transitions. [2024-06-14 14:43:35,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 163 transitions, 1558 flow [2024-06-14 14:43:35,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 163 transitions, 1460 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 14:43:35,804 INFO L231 Difference]: Finished difference. Result has 119 places, 133 transitions, 1174 flow [2024-06-14 14:43:35,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1174, PETRI_PLACES=119, PETRI_TRANSITIONS=133} [2024-06-14 14:43:35,807 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 74 predicate places. [2024-06-14 14:43:35,807 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 133 transitions, 1174 flow [2024-06-14 14:43:35,807 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:43:35,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:35,807 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:35,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:43:35,807 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:43:35,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1060770253, now seen corresponding path program 4 times [2024-06-14 14:43:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599254045] [2024-06-14 14:43:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:43:49,551 INFO 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:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:43:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599254045] [2024-06-14 14:43:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599254045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:43:49,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:43:49,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:43:49,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474796099] [2024-06-14 14:43:49,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:43:49,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:43:49,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:43:49,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:43:49,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:43:49,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:43:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 133 transitions, 1174 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:43:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:43:49,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:43:49,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:43:51,604 INFO L124 PetriNetUnfolderBase]: 2262/3479 cut-off events. [2024-06-14 14:43:51,605 INFO L125 PetriNetUnfolderBase]: For 138004/138007 co-relation queries the response was YES. [2024-06-14 14:43:51,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23084 conditions, 3479 events. 2262/3479 cut-off events. For 138004/138007 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17536 event pairs, 651 based on Foata normal form. 4/3479 useless extension candidates. Maximal degree in co-relation 23029. Up to 3084 conditions per place. [2024-06-14 14:43:51,628 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 122 selfloop transitions, 50 changer transitions 0/178 dead transitions. [2024-06-14 14:43:51,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 178 transitions, 1782 flow [2024-06-14 14:43:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:43:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:43:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2024-06-14 14:43:51,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590909090909091 [2024-06-14 14:43:51,631 INFO L175 Difference]: Start difference. First operand has 119 places, 133 transitions, 1174 flow. Second operand 10 states and 202 transitions. [2024-06-14 14:43:51,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 178 transitions, 1782 flow [2024-06-14 14:43:51,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 178 transitions, 1668 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:43:51,683 INFO L231 Difference]: Finished difference. Result has 122 places, 136 transitions, 1215 flow [2024-06-14 14:43:51,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1215, PETRI_PLACES=122, PETRI_TRANSITIONS=136} [2024-06-14 14:43:51,684 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 77 predicate places. [2024-06-14 14:43:51,684 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 1215 flow [2024-06-14 14:43:51,684 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:43:51,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:43:51,684 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:51,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:43:51,685 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:43:51,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:43:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash -457374459, now seen corresponding path program 1 times [2024-06-14 14:43:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:43:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731828083] [2024-06-14 14:43:51,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:43:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:43:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:04,573 INFO 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:04,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:04,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731828083] [2024-06-14 14:44:04,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731828083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:44:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22737234] [2024-06-14 14:44:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:04,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:44:04,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:44:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:44:04,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:44:04,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 136 transitions, 1215 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:04,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:04,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:44:04,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:06,614 INFO L124 PetriNetUnfolderBase]: 2284/3516 cut-off events. [2024-06-14 14:44:06,614 INFO L125 PetriNetUnfolderBase]: For 147785/147788 co-relation queries the response was YES. [2024-06-14 14:44:06,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23567 conditions, 3516 events. 2284/3516 cut-off events. For 147785/147788 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17819 event pairs, 619 based on Foata normal form. 6/3518 useless extension candidates. Maximal degree in co-relation 23511. Up to 2984 conditions per place. [2024-06-14 14:44:06,639 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 115 selfloop transitions, 56 changer transitions 0/177 dead transitions. [2024-06-14 14:44:06,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 177 transitions, 1813 flow [2024-06-14 14:44:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:44:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:44:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-14 14:44:06,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-14 14:44:06,643 INFO L175 Difference]: Start difference. First operand has 122 places, 136 transitions, 1215 flow. Second operand 9 states and 186 transitions. [2024-06-14 14:44:06,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 177 transitions, 1813 flow [2024-06-14 14:44:06,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 177 transitions, 1671 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 14:44:06,730 INFO L231 Difference]: Finished difference. Result has 123 places, 139 transitions, 1233 flow [2024-06-14 14:44:06,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1233, PETRI_PLACES=123, PETRI_TRANSITIONS=139} [2024-06-14 14:44:06,731 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 78 predicate places. [2024-06-14 14:44:06,731 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 139 transitions, 1233 flow [2024-06-14 14:44:06,731 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:06,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:06,732 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:06,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:44:06,732 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:44:06,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2145586535, now seen corresponding path program 2 times [2024-06-14 14:44:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637291593] [2024-06-14 14:44:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:19,597 INFO 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:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637291593] [2024-06-14 14:44:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637291593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:19,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:44:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820262188] [2024-06-14 14:44:19,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:19,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:44:19,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:19,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:44:19,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:44:19,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:44:19,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 139 transitions, 1233 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:19,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:19,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:44:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:21,593 INFO L124 PetriNetUnfolderBase]: 2338/3594 cut-off events. [2024-06-14 14:44:21,594 INFO L125 PetriNetUnfolderBase]: For 159359/159362 co-relation queries the response was YES. [2024-06-14 14:44:21,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24447 conditions, 3594 events. 2338/3594 cut-off events. For 159359/159362 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18259 event pairs, 624 based on Foata normal form. 6/3596 useless extension candidates. Maximal degree in co-relation 24390. Up to 3030 conditions per place. [2024-06-14 14:44:21,623 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 120 selfloop transitions, 57 changer transitions 0/183 dead transitions. [2024-06-14 14:44:21,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 183 transitions, 2019 flow [2024-06-14 14:44:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:44:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:44:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-06-14 14:44:21,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-14 14:44:21,627 INFO L175 Difference]: Start difference. First operand has 123 places, 139 transitions, 1233 flow. Second operand 9 states and 186 transitions. [2024-06-14 14:44:21,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 183 transitions, 2019 flow [2024-06-14 14:44:21,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1847 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-14 14:44:21,707 INFO L231 Difference]: Finished difference. Result has 125 places, 145 transitions, 1275 flow [2024-06-14 14:44:21,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1275, PETRI_PLACES=125, PETRI_TRANSITIONS=145} [2024-06-14 14:44:21,708 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 80 predicate places. [2024-06-14 14:44:21,709 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 145 transitions, 1275 flow [2024-06-14 14:44:21,709 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:21,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:21,709 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:21,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:44:21,709 INFO L420 AbstractCegarLoop]: === Iteration 33 === 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:21,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2145593045, now seen corresponding path program 3 times [2024-06-14 14:44:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:21,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902473499] [2024-06-14 14:44:21,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:21,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:36,418 INFO 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,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:36,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902473499] [2024-06-14 14:44:36,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902473499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:36,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:36,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:44:36,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517233306] [2024-06-14 14:44:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:36,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:44:36,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:36,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:44:36,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:44:36,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:44:36,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 145 transitions, 1275 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,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:36,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:44:36,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:38,530 INFO L124 PetriNetUnfolderBase]: 2328/3585 cut-off events. [2024-06-14 14:44:38,530 INFO L125 PetriNetUnfolderBase]: For 166377/166380 co-relation queries the response was YES. [2024-06-14 14:44:38,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24473 conditions, 3585 events. 2328/3585 cut-off events. For 166377/166380 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18197 event pairs, 619 based on Foata normal form. 6/3587 useless extension candidates. Maximal degree in co-relation 24415. Up to 3022 conditions per place. [2024-06-14 14:44:38,558 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 116 selfloop transitions, 58 changer transitions 0/180 dead transitions. [2024-06-14 14:44:38,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 180 transitions, 1839 flow [2024-06-14 14:44:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:44:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:44:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-14 14:44:38,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2024-06-14 14:44:38,562 INFO L175 Difference]: Start difference. First operand has 125 places, 145 transitions, 1275 flow. Second operand 9 states and 182 transitions. [2024-06-14 14:44:38,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 180 transitions, 1839 flow [2024-06-14 14:44:38,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 180 transitions, 1718 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-14 14:44:38,641 INFO L231 Difference]: Finished difference. Result has 129 places, 145 transitions, 1279 flow [2024-06-14 14:44:38,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1279, PETRI_PLACES=129, PETRI_TRANSITIONS=145} [2024-06-14 14:44:38,642 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 84 predicate places. [2024-06-14 14:44:38,642 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 145 transitions, 1279 flow [2024-06-14 14:44:38,642 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:38,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:38,642 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:38,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:44:38,643 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:44:38,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 218110485, now seen corresponding path program 5 times [2024-06-14 14:44:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240020164] [2024-06-14 14:44:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:38,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:44:53,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:44:53,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:44:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240020164] [2024-06-14 14:44:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240020164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:44:53,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:44:53,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:44:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292489105] [2024-06-14 14:44:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:44:53,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:44:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:44:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:44:53,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:44:53,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:44:53,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 145 transitions, 1279 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:53,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:44:53,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:44:53,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:44:55,233 INFO L124 PetriNetUnfolderBase]: 2339/3596 cut-off events. [2024-06-14 14:44:55,233 INFO L125 PetriNetUnfolderBase]: For 174964/174967 co-relation queries the response was YES. [2024-06-14 14:44:55,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24847 conditions, 3596 events. 2339/3596 cut-off events. For 174964/174967 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18238 event pairs, 661 based on Foata normal form. 4/3596 useless extension candidates. Maximal degree in co-relation 24788. Up to 3241 conditions per place. [2024-06-14 14:44:55,259 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 132 selfloop transitions, 40 changer transitions 0/178 dead transitions. [2024-06-14 14:44:55,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 178 transitions, 1745 flow [2024-06-14 14:44:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:44:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:44:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-14 14:44:55,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 14:44:55,263 INFO L175 Difference]: Start difference. First operand has 129 places, 145 transitions, 1279 flow. Second operand 9 states and 174 transitions. [2024-06-14 14:44:55,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 178 transitions, 1745 flow [2024-06-14 14:44:55,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 178 transitions, 1620 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 14:44:55,355 INFO L231 Difference]: Finished difference. Result has 130 places, 148 transitions, 1294 flow [2024-06-14 14:44:55,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1294, PETRI_PLACES=130, PETRI_TRANSITIONS=148} [2024-06-14 14:44:55,356 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 85 predicate places. [2024-06-14 14:44:55,356 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 148 transitions, 1294 flow [2024-06-14 14:44:55,356 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:55,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:44:55,356 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:55,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:44:55,357 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:44:55,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:44:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash -388918226, now seen corresponding path program 1 times [2024-06-14 14:44:55,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:44:55,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779991709] [2024-06-14 14:44:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:44:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:44:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:12,160 INFO 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:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779991709] [2024-06-14 14:45:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779991709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:45:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774906144] [2024-06-14 14:45:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:45:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:45:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:45:12,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:45:12,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 148 transitions, 1294 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:45:12,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:12,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:45:12,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:14,034 INFO L124 PetriNetUnfolderBase]: 2814/4203 cut-off events. [2024-06-14 14:45:14,034 INFO L125 PetriNetUnfolderBase]: For 209765/209765 co-relation queries the response was YES. [2024-06-14 14:45:14,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28671 conditions, 4203 events. 2814/4203 cut-off events. For 209765/209765 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 20327 event pairs, 876 based on Foata normal form. 1/4201 useless extension candidates. Maximal degree in co-relation 28611. Up to 4049 conditions per place. [2024-06-14 14:45:14,063 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 137 selfloop transitions, 16 changer transitions 0/170 dead transitions. [2024-06-14 14:45:14,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 170 transitions, 1780 flow [2024-06-14 14:45:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:45:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:45:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-14 14:45:14,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 14:45:14,069 INFO L175 Difference]: Start difference. First operand has 130 places, 148 transitions, 1294 flow. Second operand 6 states and 112 transitions. [2024-06-14 14:45:14,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 170 transitions, 1780 flow [2024-06-14 14:45:14,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 170 transitions, 1670 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 14:45:14,209 INFO L231 Difference]: Finished difference. Result has 129 places, 154 transitions, 1300 flow [2024-06-14 14:45:14,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1300, PETRI_PLACES=129, PETRI_TRANSITIONS=154} [2024-06-14 14:45:14,210 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 84 predicate places. [2024-06-14 14:45:14,210 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 154 transitions, 1300 flow [2024-06-14 14:45:14,210 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:45:14,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:14,210 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:14,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:45:14,211 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:45:14,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1121008579, now seen corresponding path program 4 times [2024-06-14 14:45:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:14,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803532216] [2024-06-14 14:45:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:14,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:26,320 INFO 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:26,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:26,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803532216] [2024-06-14 14:45:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803532216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:26,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:26,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:45:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511613795] [2024-06-14 14:45:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:26,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:45:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:45:26,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:45:26,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:45:26,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 154 transitions, 1300 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:45:26,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:26,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:45:26,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:28,428 INFO L124 PetriNetUnfolderBase]: 2382/3656 cut-off events. [2024-06-14 14:45:28,428 INFO L125 PetriNetUnfolderBase]: For 197344/197347 co-relation queries the response was YES. [2024-06-14 14:45:28,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25822 conditions, 3656 events. 2382/3656 cut-off events. For 197344/197347 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18530 event pairs, 655 based on Foata normal form. 6/3658 useless extension candidates. Maximal degree in co-relation 25761. Up to 3392 conditions per place. [2024-06-14 14:45:28,459 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 155 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2024-06-14 14:45:28,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 182 transitions, 1753 flow [2024-06-14 14:45:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:45:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:45:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 14:45:28,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 14:45:28,463 INFO L175 Difference]: Start difference. First operand has 129 places, 154 transitions, 1300 flow. Second operand 8 states and 152 transitions. [2024-06-14 14:45:28,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 182 transitions, 1753 flow [2024-06-14 14:45:28,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 182 transitions, 1713 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-14 14:45:28,581 INFO L231 Difference]: Finished difference. Result has 135 places, 157 transitions, 1351 flow [2024-06-14 14:45:28,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1351, PETRI_PLACES=135, PETRI_TRANSITIONS=157} [2024-06-14 14:45:28,581 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 90 predicate places. [2024-06-14 14:45:28,582 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 157 transitions, 1351 flow [2024-06-14 14:45:28,582 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:45:28,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:28,582 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:28,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:45:28,582 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:45:28,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash -948700149, now seen corresponding path program 5 times [2024-06-14 14:45:28,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:28,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429932633] [2024-06-14 14:45:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:28,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:45:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429932633] [2024-06-14 14:45:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429932633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:41,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:45:41,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317709770] [2024-06-14 14:45:41,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:41,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:45:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:45:41,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:45:42,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:45:42,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 157 transitions, 1351 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:45:42,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:42,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:45:42,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:45:43,893 INFO L124 PetriNetUnfolderBase]: 2404/3688 cut-off events. [2024-06-14 14:45:43,894 INFO L125 PetriNetUnfolderBase]: For 208418/208421 co-relation queries the response was YES. [2024-06-14 14:45:43,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26391 conditions, 3688 events. 2404/3688 cut-off events. For 208418/208421 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 18725 event pairs, 653 based on Foata normal form. 6/3690 useless extension candidates. Maximal degree in co-relation 26328. Up to 3341 conditions per place. [2024-06-14 14:45:43,921 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 148 selfloop transitions, 32 changer transitions 0/188 dead transitions. [2024-06-14 14:45:43,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 188 transitions, 1968 flow [2024-06-14 14:45:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:45:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:45:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-14 14:45:43,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-06-14 14:45:43,925 INFO L175 Difference]: Start difference. First operand has 135 places, 157 transitions, 1351 flow. Second operand 8 states and 158 transitions. [2024-06-14 14:45:43,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 188 transitions, 1968 flow [2024-06-14 14:45:44,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 188 transitions, 1910 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 14:45:44,029 INFO L231 Difference]: Finished difference. Result has 137 places, 160 transitions, 1410 flow [2024-06-14 14:45:44,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1410, PETRI_PLACES=137, PETRI_TRANSITIONS=160} [2024-06-14 14:45:44,029 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 92 predicate places. [2024-06-14 14:45:44,029 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 160 transitions, 1410 flow [2024-06-14 14:45:44,030 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:45:44,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:45:44,030 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:44,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:45:44,030 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:45:44,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:45:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash -948700335, now seen corresponding path program 6 times [2024-06-14 14:45:44,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:45:44,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860081469] [2024-06-14 14:45:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:45:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:45:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:45:58,393 INFO 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:58,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:45:58,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860081469] [2024-06-14 14:45:58,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860081469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:45:58,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:45:58,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:45:58,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998735547] [2024-06-14 14:45:58,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:45:58,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:45:58,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:45:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:45:58,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:45:58,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:45:58,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 160 transitions, 1410 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:45:58,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:45:58,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:45:58,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:00,501 INFO L124 PetriNetUnfolderBase]: 2399/3681 cut-off events. [2024-06-14 14:46:00,502 INFO L125 PetriNetUnfolderBase]: For 216750/216753 co-relation queries the response was YES. [2024-06-14 14:46:00,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26618 conditions, 3681 events. 2399/3681 cut-off events. For 216750/216753 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18650 event pairs, 665 based on Foata normal form. 4/3681 useless extension candidates. Maximal degree in co-relation 26554. Up to 3440 conditions per place. [2024-06-14 14:46:00,529 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 156 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2024-06-14 14:46:00,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 183 transitions, 1818 flow [2024-06-14 14:46:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:46:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:46:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 14:46:00,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2024-06-14 14:46:00,533 INFO L175 Difference]: Start difference. First operand has 137 places, 160 transitions, 1410 flow. Second operand 8 states and 150 transitions. [2024-06-14 14:46:00,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 183 transitions, 1818 flow [2024-06-14 14:46:00,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 183 transitions, 1648 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-14 14:46:00,659 INFO L231 Difference]: Finished difference. Result has 138 places, 160 transitions, 1286 flow [2024-06-14 14:46:00,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1286, PETRI_PLACES=138, PETRI_TRANSITIONS=160} [2024-06-14 14:46:00,660 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 93 predicate places. [2024-06-14 14:46:00,660 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 160 transitions, 1286 flow [2024-06-14 14:46:00,660 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:46:00,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:00,660 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:00,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:46:00,660 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:46:00,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 779702759, now seen corresponding path program 6 times [2024-06-14 14:46:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444806821] [2024-06-14 14:46:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:12,550 INFO 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:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:12,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444806821] [2024-06-14 14:46:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444806821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:12,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:12,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:46:12,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983332299] [2024-06-14 14:46:12,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:12,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:46:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:12,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:46:12,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:46:12,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:46:12,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 160 transitions, 1286 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:46:12,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:12,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:46:12,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:14,542 INFO L124 PetriNetUnfolderBase]: 2389/3667 cut-off events. [2024-06-14 14:46:14,543 INFO L125 PetriNetUnfolderBase]: For 225178/225181 co-relation queries the response was YES. [2024-06-14 14:46:14,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26411 conditions, 3667 events. 2389/3667 cut-off events. For 225178/225181 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18636 event pairs, 658 based on Foata normal form. 6/3669 useless extension candidates. Maximal degree in co-relation 26346. Up to 3326 conditions per place. [2024-06-14 14:46:14,575 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 146 selfloop transitions, 33 changer transitions 0/187 dead transitions. [2024-06-14 14:46:14,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 187 transitions, 1726 flow [2024-06-14 14:46:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:46:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:46:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-14 14:46:14,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 14:46:14,580 INFO L175 Difference]: Start difference. First operand has 138 places, 160 transitions, 1286 flow. Second operand 9 states and 168 transitions. [2024-06-14 14:46:14,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 187 transitions, 1726 flow [2024-06-14 14:46:14,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 187 transitions, 1647 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 14:46:14,718 INFO L231 Difference]: Finished difference. Result has 141 places, 162 transitions, 1300 flow [2024-06-14 14:46:14,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1300, PETRI_PLACES=141, PETRI_TRANSITIONS=162} [2024-06-14 14:46:14,720 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-06-14 14:46:14,720 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 162 transitions, 1300 flow [2024-06-14 14:46:14,720 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:46:14,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:14,720 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:14,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:46:14,720 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:46:14,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash -375585746, now seen corresponding path program 2 times [2024-06-14 14:46:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:14,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633264244] [2024-06-14 14:46:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:30,653 INFO 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:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633264244] [2024-06-14 14:46:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633264244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:30,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:46:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473762056] [2024-06-14 14:46:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:30,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:46:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:30,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:46:30,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:46:30,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:46:30,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 162 transitions, 1300 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:46:30,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:30,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:46:30,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:32,544 INFO L124 PetriNetUnfolderBase]: 2853/4263 cut-off events. [2024-06-14 14:46:32,545 INFO L125 PetriNetUnfolderBase]: For 264803/264803 co-relation queries the response was YES. [2024-06-14 14:46:32,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30387 conditions, 4263 events. 2853/4263 cut-off events. For 264803/264803 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 20648 event pairs, 881 based on Foata normal form. 1/4261 useless extension candidates. Maximal degree in co-relation 30320. Up to 4130 conditions per place. [2024-06-14 14:46:32,579 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 141 selfloop transitions, 12 changer transitions 0/170 dead transitions. [2024-06-14 14:46:32,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 170 transitions, 1626 flow [2024-06-14 14:46:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:46:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:46:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-14 14:46:32,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39015151515151514 [2024-06-14 14:46:32,580 INFO L175 Difference]: Start difference. First operand has 141 places, 162 transitions, 1300 flow. Second operand 6 states and 103 transitions. [2024-06-14 14:46:32,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 170 transitions, 1626 flow [2024-06-14 14:46:32,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 170 transitions, 1529 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-14 14:46:32,750 INFO L231 Difference]: Finished difference. Result has 141 places, 162 transitions, 1233 flow [2024-06-14 14:46:32,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1233, PETRI_PLACES=141, PETRI_TRANSITIONS=162} [2024-06-14 14:46:32,762 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-06-14 14:46:32,762 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 162 transitions, 1233 flow [2024-06-14 14:46:32,762 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:46:32,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:32,763 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:32,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:46:32,763 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:46:32,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash -383198354, now seen corresponding path program 1 times [2024-06-14 14:46:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828880778] [2024-06-14 14:46:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:46:52,176 INFO 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:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:46:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828880778] [2024-06-14 14:46:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828880778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:46:52,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:46:52,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:46:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760636203] [2024-06-14 14:46:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:46:52,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:46:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:46:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:46:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:46:52,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:46:52,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 162 transitions, 1233 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:46:52,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:46:52,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:46:52,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:46:54,323 INFO L124 PetriNetUnfolderBase]: 2858/4270 cut-off events. [2024-06-14 14:46:54,323 INFO L125 PetriNetUnfolderBase]: For 276646/276646 co-relation queries the response was YES. [2024-06-14 14:46:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30499 conditions, 4270 events. 2858/4270 cut-off events. For 276646/276646 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 20649 event pairs, 881 based on Foata normal form. 1/4268 useless extension candidates. Maximal degree in co-relation 30430. Up to 4124 conditions per place. [2024-06-14 14:46:54,355 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 146 selfloop transitions, 17 changer transitions 0/180 dead transitions. [2024-06-14 14:46:54,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 180 transitions, 1733 flow [2024-06-14 14:46:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:46:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:46:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-14 14:46:54,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-14 14:46:54,356 INFO L175 Difference]: Start difference. First operand has 141 places, 162 transitions, 1233 flow. Second operand 6 states and 109 transitions. [2024-06-14 14:46:54,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 180 transitions, 1733 flow [2024-06-14 14:46:54,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 180 transitions, 1698 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 14:46:54,508 INFO L231 Difference]: Finished difference. Result has 142 places, 168 transitions, 1308 flow [2024-06-14 14:46:54,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1308, PETRI_PLACES=142, PETRI_TRANSITIONS=168} [2024-06-14 14:46:54,509 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 97 predicate places. [2024-06-14 14:46:54,509 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 168 transitions, 1308 flow [2024-06-14 14:46:54,509 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:46:54,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:46:54,509 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:54,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:46:54,509 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:46:54,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:46:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1198278736, now seen corresponding path program 2 times [2024-06-14 14:46:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:46:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564484068] [2024-06-14 14:46:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:46:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:46:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:14,377 INFO 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:14,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:14,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564484068] [2024-06-14 14:47:14,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564484068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:14,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:14,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:47:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607926149] [2024-06-14 14:47:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:14,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:47:14,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:47:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:47:14,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:47:14,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 168 transitions, 1308 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:47:14,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:14,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:47:14,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:16,514 INFO L124 PetriNetUnfolderBase]: 2855/4267 cut-off events. [2024-06-14 14:47:16,514 INFO L125 PetriNetUnfolderBase]: For 289743/289746 co-relation queries the response was YES. [2024-06-14 14:47:16,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31138 conditions, 4267 events. 2855/4267 cut-off events. For 289743/289746 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 20702 event pairs, 884 based on Foata normal form. 3/4266 useless extension candidates. Maximal degree in co-relation 31068. Up to 4121 conditions per place. [2024-06-14 14:47:16,544 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 142 selfloop transitions, 17 changer transitions 0/176 dead transitions. [2024-06-14 14:47:16,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 176 transitions, 1646 flow [2024-06-14 14:47:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:47:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:47:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-14 14:47:16,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 14:47:16,545 INFO L175 Difference]: Start difference. First operand has 142 places, 168 transitions, 1308 flow. Second operand 6 states and 105 transitions. [2024-06-14 14:47:16,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 176 transitions, 1646 flow [2024-06-14 14:47:16,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 176 transitions, 1591 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-06-14 14:47:16,734 INFO L231 Difference]: Finished difference. Result has 146 places, 168 transitions, 1293 flow [2024-06-14 14:47:16,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1293, PETRI_PLACES=146, PETRI_TRANSITIONS=168} [2024-06-14 14:47:16,735 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 101 predicate places. [2024-06-14 14:47:16,736 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 168 transitions, 1293 flow [2024-06-14 14:47:16,736 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:47:16,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:16,736 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:16,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:47:16,736 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:47:16,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -940111599, now seen corresponding path program 1 times [2024-06-14 14:47:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:16,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451724935] [2024-06-14 14:47:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:16,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:34,766 INFO 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,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:34,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451724935] [2024-06-14 14:47:34,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451724935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:34,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:34,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:47:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426809306] [2024-06-14 14:47:34,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:34,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:47:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:47:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:47:34,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-06-14 14:47:34,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 168 transitions, 1293 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:34,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:34,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-06-14 14:47:34,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:37,094 INFO L124 PetriNetUnfolderBase]: 2789/4196 cut-off events. [2024-06-14 14:47:37,094 INFO L125 PetriNetUnfolderBase]: For 302873/302873 co-relation queries the response was YES. [2024-06-14 14:47:37,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30982 conditions, 4196 events. 2789/4196 cut-off events. For 302873/302873 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20485 event pairs, 787 based on Foata normal form. 4/4197 useless extension candidates. Maximal degree in co-relation 30910. Up to 3975 conditions per place. [2024-06-14 14:47:37,128 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 169 selfloop transitions, 22 changer transitions 0/200 dead transitions. [2024-06-14 14:47:37,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 200 transitions, 1801 flow [2024-06-14 14:47:37,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:47:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:47:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-14 14:47:37,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-14 14:47:37,133 INFO L175 Difference]: Start difference. First operand has 146 places, 168 transitions, 1293 flow. Second operand 9 states and 159 transitions. [2024-06-14 14:47:37,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 200 transitions, 1801 flow [2024-06-14 14:47:37,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 200 transitions, 1748 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 14:47:37,338 INFO L231 Difference]: Finished difference. Result has 150 places, 173 transitions, 1359 flow [2024-06-14 14:47:37,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1359, PETRI_PLACES=150, PETRI_TRANSITIONS=173} [2024-06-14 14:47:37,339 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 105 predicate places. [2024-06-14 14:47:37,339 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 173 transitions, 1359 flow [2024-06-14 14:47:37,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:37,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:37,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:47:37,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:47:37,340 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:47:37,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1436048079, now seen corresponding path program 1 times [2024-06-14 14:47:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:37,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154319361] [2024-06-14 14:47:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:37,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:47:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:47:53,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:47:53,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154319361] [2024-06-14 14:47:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154319361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:47:53,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:47:53,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:47:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527507985] [2024-06-14 14:47:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:47:53,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:47:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:47:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:47:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:47:53,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:47:53,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 173 transitions, 1359 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:53,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:47:53,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:47:53,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:47:55,815 INFO L124 PetriNetUnfolderBase]: 2648/4045 cut-off events. [2024-06-14 14:47:55,815 INFO L125 PetriNetUnfolderBase]: For 310552/310555 co-relation queries the response was YES. [2024-06-14 14:47:55,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30836 conditions, 4045 events. 2648/4045 cut-off events. For 310552/310555 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 20436 event pairs, 586 based on Foata normal form. 6/4047 useless extension candidates. Maximal degree in co-relation 30763. Up to 3387 conditions per place. [2024-06-14 14:47:55,853 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 141 selfloop transitions, 66 changer transitions 0/218 dead transitions. [2024-06-14 14:47:55,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 218 transitions, 2111 flow [2024-06-14 14:47:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:47:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:47:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-14 14:47:55,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2024-06-14 14:47:55,857 INFO L175 Difference]: Start difference. First operand has 150 places, 173 transitions, 1359 flow. Second operand 10 states and 199 transitions. [2024-06-14 14:47:55,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 218 transitions, 2111 flow [2024-06-14 14:47:56,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 218 transitions, 2036 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 14:47:56,042 INFO L231 Difference]: Finished difference. Result has 154 places, 177 transitions, 1499 flow [2024-06-14 14:47:56,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1499, PETRI_PLACES=154, PETRI_TRANSITIONS=177} [2024-06-14 14:47:56,042 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 109 predicate places. [2024-06-14 14:47:56,042 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 177 transitions, 1499 flow [2024-06-14 14:47:56,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:47:56,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:47:56,043 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:47:56,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:47:56,043 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:47:56,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:47:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1435961589, now seen corresponding path program 2 times [2024-06-14 14:47:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:47:56,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602643488] [2024-06-14 14:47:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:47:56,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:47:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:48:12,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602643488] [2024-06-14 14:48:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602643488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:12,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:12,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:48:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537194521] [2024-06-14 14:48:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:12,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:48:12,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:12,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:48:12,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:48:12,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:48:12,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 177 transitions, 1499 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:12,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:12,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:48:12,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:14,780 INFO L124 PetriNetUnfolderBase]: 2708/4139 cut-off events. [2024-06-14 14:48:14,780 INFO L125 PetriNetUnfolderBase]: For 329740/329743 co-relation queries the response was YES. [2024-06-14 14:48:14,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32081 conditions, 4139 events. 2708/4139 cut-off events. For 329740/329743 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 21084 event pairs, 730 based on Foata normal form. 6/4141 useless extension candidates. Maximal degree in co-relation 32007. Up to 3601 conditions per place. [2024-06-14 14:48:14,815 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 148 selfloop transitions, 64 changer transitions 0/223 dead transitions. [2024-06-14 14:48:14,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 223 transitions, 2283 flow [2024-06-14 14:48:14,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:48:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:48:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2024-06-14 14:48:14,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2024-06-14 14:48:14,819 INFO L175 Difference]: Start difference. First operand has 154 places, 177 transitions, 1499 flow. Second operand 10 states and 199 transitions. [2024-06-14 14:48:14,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 223 transitions, 2283 flow [2024-06-14 14:48:15,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 223 transitions, 2137 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-14 14:48:15,035 INFO L231 Difference]: Finished difference. Result has 159 places, 183 transitions, 1594 flow [2024-06-14 14:48:15,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1594, PETRI_PLACES=159, PETRI_TRANSITIONS=183} [2024-06-14 14:48:15,037 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 114 predicate places. [2024-06-14 14:48:15,038 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 183 transitions, 1594 flow [2024-06-14 14:48:15,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:15,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:15,038 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:48:15,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:48:15,038 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:48:15,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1435957714, now seen corresponding path program 1 times [2024-06-14 14:48:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159527233] [2024-06-14 14:48:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:29,966 INFO 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:29,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:29,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159527233] [2024-06-14 14:48:29,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159527233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:29,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:29,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:48:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714741371] [2024-06-14 14:48:29,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:29,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:48:29,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:29,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:48:29,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:48:30,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:48:30,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 183 transitions, 1594 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:30,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:30,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:48:30,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:32,382 INFO L124 PetriNetUnfolderBase]: 2753/4197 cut-off events. [2024-06-14 14:48:32,382 INFO L125 PetriNetUnfolderBase]: For 345521/345524 co-relation queries the response was YES. [2024-06-14 14:48:32,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32863 conditions, 4197 events. 2753/4197 cut-off events. For 345521/345524 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 21319 event pairs, 680 based on Foata normal form. 6/4197 useless extension candidates. Maximal degree in co-relation 32786. Up to 3359 conditions per place. [2024-06-14 14:48:32,415 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 134 selfloop transitions, 85 changer transitions 0/230 dead transitions. [2024-06-14 14:48:32,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 230 transitions, 2400 flow [2024-06-14 14:48:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:48:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:48:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-14 14:48:32,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46136363636363636 [2024-06-14 14:48:32,419 INFO L175 Difference]: Start difference. First operand has 159 places, 183 transitions, 1594 flow. Second operand 10 states and 203 transitions. [2024-06-14 14:48:32,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 230 transitions, 2400 flow [2024-06-14 14:48:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 230 transitions, 2311 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 14:48:32,606 INFO L231 Difference]: Finished difference. Result has 163 places, 189 transitions, 1777 flow [2024-06-14 14:48:32,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1777, PETRI_PLACES=163, PETRI_TRANSITIONS=189} [2024-06-14 14:48:32,607 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 118 predicate places. [2024-06-14 14:48:32,607 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 189 transitions, 1777 flow [2024-06-14 14:48:32,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:32,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:32,607 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:48:32,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:48:32,607 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:48:32,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1199765413, now seen corresponding path program 3 times [2024-06-14 14:48:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:32,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234835918] [2024-06-14 14:48:32,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:32,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:48:48,376 INFO 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:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:48:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234835918] [2024-06-14 14:48:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234835918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:48:48,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:48:48,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:48:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57632465] [2024-06-14 14:48:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:48:48,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:48:48,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:48:48,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:48:48,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:48:48,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:48:48,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 189 transitions, 1777 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:48,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:48:48,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:48:48,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:48:50,805 INFO L124 PetriNetUnfolderBase]: 2745/4185 cut-off events. [2024-06-14 14:48:50,805 INFO L125 PetriNetUnfolderBase]: For 357773/357776 co-relation queries the response was YES. [2024-06-14 14:48:50,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33616 conditions, 4185 events. 2745/4185 cut-off events. For 357773/357776 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 21233 event pairs, 733 based on Foata normal form. 6/4185 useless extension candidates. Maximal degree in co-relation 33537. Up to 3698 conditions per place. [2024-06-14 14:48:50,842 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 154 selfloop transitions, 61 changer transitions 0/226 dead transitions. [2024-06-14 14:48:50,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 226 transitions, 2305 flow [2024-06-14 14:48:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:48:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:48:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-06-14 14:48:50,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-06-14 14:48:50,852 INFO L175 Difference]: Start difference. First operand has 163 places, 189 transitions, 1777 flow. Second operand 10 states and 195 transitions. [2024-06-14 14:48:50,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 226 transitions, 2305 flow [2024-06-14 14:48:51,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 226 transitions, 2169 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-14 14:48:51,154 INFO L231 Difference]: Finished difference. Result has 167 places, 189 transitions, 1770 flow [2024-06-14 14:48:51,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1770, PETRI_PLACES=167, PETRI_TRANSITIONS=189} [2024-06-14 14:48:51,155 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 122 predicate places. [2024-06-14 14:48:51,155 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 189 transitions, 1770 flow [2024-06-14 14:48:51,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:48:51,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:48:51,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:48:51,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:48:51,156 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 14:48:51,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:48:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1112923718, now seen corresponding path program 2 times [2024-06-14 14:48:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:48:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436533617] [2024-06-14 14:48:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:48:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:48:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:06,837 INFO 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:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436533617] [2024-06-14 14:49:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436533617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:06,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:06,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:49:06,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986859541] [2024-06-14 14:49:06,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:06,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:49:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:06,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:49:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:49:07,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:49:07,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 189 transitions, 1770 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:07,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:07,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:49:07,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:09,182 INFO L124 PetriNetUnfolderBase]: 2767/4222 cut-off events. [2024-06-14 14:49:09,182 INFO L125 PetriNetUnfolderBase]: For 372996/372999 co-relation queries the response was YES. [2024-06-14 14:49:09,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34195 conditions, 4222 events. 2767/4222 cut-off events. For 372996/372999 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 21537 event pairs, 691 based on Foata normal form. 6/4222 useless extension candidates. Maximal degree in co-relation 34114. Up to 3589 conditions per place. [2024-06-14 14:49:09,218 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 149 selfloop transitions, 68 changer transitions 0/228 dead transitions. [2024-06-14 14:49:09,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 228 transitions, 2344 flow [2024-06-14 14:49:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:49:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:49:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-06-14 14:49:09,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-14 14:49:09,222 INFO L175 Difference]: Start difference. First operand has 167 places, 189 transitions, 1770 flow. Second operand 10 states and 198 transitions. [2024-06-14 14:49:09,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 228 transitions, 2344 flow [2024-06-14 14:49:09,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 228 transitions, 2223 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 14:49:09,448 INFO L231 Difference]: Finished difference. Result has 169 places, 192 transitions, 1841 flow [2024-06-14 14:49:09,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1841, PETRI_PLACES=169, PETRI_TRANSITIONS=192} [2024-06-14 14:49:09,448 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 124 predicate places. [2024-06-14 14:49:09,449 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 192 transitions, 1841 flow [2024-06-14 14:49:09,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:09,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:09,449 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:09,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:49:09,449 INFO L420 AbstractCegarLoop]: === Iteration 49 === 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:09,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1112929298, now seen corresponding path program 3 times [2024-06-14 14:49:09,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025987177] [2024-06-14 14:49:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:49:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025987177] [2024-06-14 14:49:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025987177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:23,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:23,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:49:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297594913] [2024-06-14 14:49:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:23,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:49:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:23,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:49:23,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:49:23,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:49:23,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 192 transitions, 1841 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:23,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:23,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:49:23,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:26,159 INFO L124 PetriNetUnfolderBase]: 2786/4260 cut-off events. [2024-06-14 14:49:26,159 INFO L125 PetriNetUnfolderBase]: For 390301/390304 co-relation queries the response was YES. [2024-06-14 14:49:26,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34859 conditions, 4260 events. 2786/4260 cut-off events. For 390301/390304 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 21874 event pairs, 678 based on Foata normal form. 6/4262 useless extension candidates. Maximal degree in co-relation 34777. Up to 3558 conditions per place. [2024-06-14 14:49:26,201 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 149 selfloop transitions, 78 changer transitions 0/238 dead transitions. [2024-06-14 14:49:26,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 238 transitions, 2695 flow [2024-06-14 14:49:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:49:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:49:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-06-14 14:49:26,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46136363636363636 [2024-06-14 14:49:26,204 INFO L175 Difference]: Start difference. First operand has 169 places, 192 transitions, 1841 flow. Second operand 10 states and 203 transitions. [2024-06-14 14:49:26,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 238 transitions, 2695 flow [2024-06-14 14:49:26,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 238 transitions, 2533 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:49:26,555 INFO L231 Difference]: Finished difference. Result has 172 places, 198 transitions, 2002 flow [2024-06-14 14:49:26,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2002, PETRI_PLACES=172, PETRI_TRANSITIONS=198} [2024-06-14 14:49:26,556 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 127 predicate places. [2024-06-14 14:49:26,572 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 198 transitions, 2002 flow [2024-06-14 14:49:26,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:26,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:26,572 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:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:49:26,573 INFO L420 AbstractCegarLoop]: === Iteration 50 === 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:26,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:26,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1112929453, now seen corresponding path program 4 times [2024-06-14 14:49:26,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:26,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535341135] [2024-06-14 14:49:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:40,607 INFO 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:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535341135] [2024-06-14 14:49:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535341135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:40,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:49:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38940635] [2024-06-14 14:49:40,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:40,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:49:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:49:40,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:49:40,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:49:40,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 198 transitions, 2002 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:40,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:40,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:49:40,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:49:43,008 INFO L124 PetriNetUnfolderBase]: 2803/4287 cut-off events. [2024-06-14 14:49:43,009 INFO L125 PetriNetUnfolderBase]: For 407738/407741 co-relation queries the response was YES. [2024-06-14 14:49:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35871 conditions, 4287 events. 2803/4287 cut-off events. For 407738/407741 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 22002 event pairs, 727 based on Foata normal form. 6/4289 useless extension candidates. Maximal degree in co-relation 35787. Up to 3878 conditions per place. [2024-06-14 14:49:43,045 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 180 selfloop transitions, 43 changer transitions 0/234 dead transitions. [2024-06-14 14:49:43,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 234 transitions, 2566 flow [2024-06-14 14:49:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:49:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:49:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-14 14:49:43,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-06-14 14:49:43,047 INFO L175 Difference]: Start difference. First operand has 172 places, 198 transitions, 2002 flow. Second operand 10 states and 192 transitions. [2024-06-14 14:49:43,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 234 transitions, 2566 flow [2024-06-14 14:49:43,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 234 transitions, 2429 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 14:49:43,302 INFO L231 Difference]: Finished difference. Result has 175 places, 200 transitions, 1992 flow [2024-06-14 14:49:43,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1992, PETRI_PLACES=175, PETRI_TRANSITIONS=200} [2024-06-14 14:49:43,303 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 130 predicate places. [2024-06-14 14:49:43,303 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 200 transitions, 1992 flow [2024-06-14 14:49:43,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:43,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:49:43,303 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:43,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:49:43,304 INFO L420 AbstractCegarLoop]: === Iteration 51 === 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:43,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:49:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1432386669, now seen corresponding path program 5 times [2024-06-14 14:49:43,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:49:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329772208] [2024-06-14 14:49:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:49:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:49:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:49:58,996 INFO 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:58,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:49:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329772208] [2024-06-14 14:49:58,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329772208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:49:58,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:49:58,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:49:58,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159448514] [2024-06-14 14:49:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:49:58,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:49:58,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:49:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:49:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:49:59,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:49:59,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 200 transitions, 1992 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:49:59,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:49:59,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:49:59,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:01,661 INFO L124 PetriNetUnfolderBase]: 2845/4353 cut-off events. [2024-06-14 14:50:01,662 INFO L125 PetriNetUnfolderBase]: For 428190/428193 co-relation queries the response was YES. [2024-06-14 14:50:01,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36508 conditions, 4353 events. 2845/4353 cut-off events. For 428190/428193 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 22462 event pairs, 729 based on Foata normal form. 6/4355 useless extension candidates. Maximal degree in co-relation 36423. Up to 3861 conditions per place. [2024-06-14 14:50:01,708 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 177 selfloop transitions, 53 changer transitions 0/241 dead transitions. [2024-06-14 14:50:01,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 241 transitions, 2802 flow [2024-06-14 14:50:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:50:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:50:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-06-14 14:50:01,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-06-14 14:50:01,712 INFO L175 Difference]: Start difference. First operand has 175 places, 200 transitions, 1992 flow. Second operand 10 states and 196 transitions. [2024-06-14 14:50:01,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 241 transitions, 2802 flow [2024-06-14 14:50:02,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 241 transitions, 2697 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 14:50:02,014 INFO L231 Difference]: Finished difference. Result has 177 places, 204 transitions, 2072 flow [2024-06-14 14:50:02,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2072, PETRI_PLACES=177, PETRI_TRANSITIONS=204} [2024-06-14 14:50:02,015 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 132 predicate places. [2024-06-14 14:50:02,015 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 204 transitions, 2072 flow [2024-06-14 14:50:02,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:02,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:02,015 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:02,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:50:02,016 INFO L420 AbstractCegarLoop]: === Iteration 52 === 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:02,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1944634157, now seen corresponding path program 6 times [2024-06-14 14:50:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819270799] [2024-06-14 14:50:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:50:16,459 INFO 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:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:50:16,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819270799] [2024-06-14 14:50:16,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819270799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:50:16,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:50:16,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:50:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551540632] [2024-06-14 14:50:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:50:16,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:50:16,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:50:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:50:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:50:16,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2024-06-14 14:50:16,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 204 transitions, 2072 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:16,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:50:16,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2024-06-14 14:50:16,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:50:18,932 INFO L124 PetriNetUnfolderBase]: 2837/4341 cut-off events. [2024-06-14 14:50:18,932 INFO L125 PetriNetUnfolderBase]: For 440198/440201 co-relation queries the response was YES. [2024-06-14 14:50:18,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36617 conditions, 4341 events. 2837/4341 cut-off events. For 440198/440201 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 22401 event pairs, 732 based on Foata normal form. 6/4343 useless extension candidates. Maximal degree in co-relation 36531. Up to 3914 conditions per place. [2024-06-14 14:50:18,974 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 179 selfloop transitions, 48 changer transitions 0/238 dead transitions. [2024-06-14 14:50:18,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 238 transitions, 2614 flow [2024-06-14 14:50:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:50:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:50:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2024-06-14 14:50:18,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43863636363636366 [2024-06-14 14:50:18,977 INFO L175 Difference]: Start difference. First operand has 177 places, 204 transitions, 2072 flow. Second operand 10 states and 193 transitions. [2024-06-14 14:50:18,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 238 transitions, 2614 flow [2024-06-14 14:50:19,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 238 transitions, 2501 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-14 14:50:19,350 INFO L231 Difference]: Finished difference. Result has 180 places, 204 transitions, 2062 flow [2024-06-14 14:50:19,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2062, PETRI_PLACES=180, PETRI_TRANSITIONS=204} [2024-06-14 14:50:19,351 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 135 predicate places. [2024-06-14 14:50:19,351 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 204 transitions, 2062 flow [2024-06-14 14:50:19,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:50:19,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:50:19,351 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:19,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:50:19,352 INFO L420 AbstractCegarLoop]: === Iteration 53 === 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:19,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:50:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1113073448, now seen corresponding path program 4 times [2024-06-14 14:50:19,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:50:19,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558760406] [2024-06-14 14:50:19,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:50:19,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:50:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15