./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix052_pso.opt_rmo.opt_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/mix052_pso.opt_rmo.opt_tso.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix052_pso.opt_rmo.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:55:47,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:55:47,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:55:47,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:55:47,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:55:47,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:55:47,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:55:47,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:55:47,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:55:47,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:55:47,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:55:47,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:55:47,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:55:47,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:55:47,273 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:55:47,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:55:47,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:55:47,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:55:47,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:55:47,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:55:47,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:55:47,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:55:47,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:55:47,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:55:47,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:55:47,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:55:47,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:55:47,276 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:55:47,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:55:47,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:55:47,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:55:47,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:55:47,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:55:47,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:55:47,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:55:47,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:55:47,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:55:47,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:55:47,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:55:47,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:55:47,280 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:55:47,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:55:47,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:55:47,280 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 11:55:47,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:55:47,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:55:47,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:55:47,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:55:47,506 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:55:47,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2024-05-12 11:55:48,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:55:48,854 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:55:48,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2024-05-12 11:55:48,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9ed930e/d2dd86b4178f49f4834d7e8d1ea7cf47/FLAGda353d3fc [2024-05-12 11:55:48,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b9ed930e/d2dd86b4178f49f4834d7e8d1ea7cf47 [2024-05-12 11:55:48,879 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:55:48,879 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:55:48,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix052_pso.opt_rmo.opt_tso.opt.yml/witness.yml [2024-05-12 11:55:49,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:55:49,043 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:55:49,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:55:49,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:55:49,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:55:49,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:55:48" (1/2) ... [2024-05-12 11:55:49,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c2c40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:55:49, skipping insertion in model container [2024-05-12 11:55:49,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:55:48" (1/2) ... [2024-05-12 11:55:49,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5784362f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:55:49, skipping insertion in model container [2024-05-12 11:55:49,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:55:49" (2/2) ... [2024-05-12 11:55:49,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c2c40a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49, skipping insertion in model container [2024-05-12 11:55:49,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:55:49" (2/2) ... [2024-05-12 11:55:49,051 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:55:49,113 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:55:49,114 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-05-12 11:55:49,115 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-05-12 11:55:49,115 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-05-12 11:55:49,116 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:55:49,116 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-05-12 11:55:49,152 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:55:49,302 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2024-05-12 11:55:49,462 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:55:49,471 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:55:49,500 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:55:49,767 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:55:49,797 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:55:49,798 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49 WrapperNode [2024-05-12 11:55:49,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:55:49,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:55:49,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:55:49,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:55:49,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:49,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:49,936 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-05-12 11:55:49,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:55:49,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:55:49,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:55:49,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:55:49,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:49,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:49,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:50,012 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 11:55:50,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:50,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:50,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:50,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:50,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:50,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:50,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:55:50,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:55:50,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:55:50,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:55:50,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (1/1) ... [2024-05-12 11:55:50,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:55:50,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:55:50,108 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-05-12 11:55:50,111 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-05-12 11:55:50,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:55:50,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:55:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:55:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:55:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:55:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:55:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:55:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:55:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:55:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:55:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:55:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:55:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:55:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:55:50,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:55:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:55:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:55:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:55:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:55:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:55:50,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:55:50,145 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:55:50,308 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:55:50,310 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:55:51,333 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:55:51,334 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:55:51,593 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:55:51,594 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:55:51,595 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:55:51 BoogieIcfgContainer [2024-05-12 11:55:51,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:55:51,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:55:51,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:55:51,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:55:51,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:55:48" (1/4) ... [2024-05-12 11:55:51,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:55:51, skipping insertion in model container [2024-05-12 11:55:51,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:55:49" (2/4) ... [2024-05-12 11:55:51,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c6cc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:55:51, skipping insertion in model container [2024-05-12 11:55:51,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:55:49" (3/4) ... [2024-05-12 11:55:51,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c6cc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:55:51, skipping insertion in model container [2024-05-12 11:55:51,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:55:51" (4/4) ... [2024-05-12 11:55:51,604 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2024-05-12 11:55:51,616 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:55:51,617 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:55:51,617 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:55:51,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:55:51,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 11:55:51,807 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-05-12 11:55:51,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:55:51,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-05-12 11:55:51,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 11:55:51,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-05-12 11:55:51,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:55:51,847 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;@afa4a9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:55:51,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:55:51,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:55:51,856 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:55:51,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:55:51,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:51,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:55:51,858 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:51,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:51,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2115248909, now seen corresponding path program 1 times [2024-05-12 11:55:51,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:51,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618665453] [2024-05-12 11:55:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:51,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:57,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618665453] [2024-05-12 11:55:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618665453] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:57,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:55:57,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138903446] [2024-05-12 11:55:57,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:57,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:55:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:57,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:55:57,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:55:57,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-05-12 11:55:57,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:57,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:57,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-05-12 11:55:57,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:58,535 INFO L124 PetriNetUnfolderBase]: 2575/4448 cut-off events. [2024-05-12 11:55:58,535 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-05-12 11:55:58,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8260 conditions, 4448 events. 2575/4448 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 29195 event pairs, 2072 based on Foata normal form. 151/4222 useless extension candidates. Maximal degree in co-relation 8245. Up to 3731 conditions per place. [2024-05-12 11:55:58,559 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 41 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-05-12 11:55:58,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 223 flow [2024-05-12 11:55:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:55:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:55:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-05-12 11:55:58,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2024-05-12 11:55:58,570 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 96 transitions. [2024-05-12 11:55:58,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 223 flow [2024-05-12 11:55:58,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:55:58,574 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 129 flow [2024-05-12 11:55:58,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-05-12 11:55:58,578 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-05-12 11:55:58,578 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 129 flow [2024-05-12 11:55:58,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:58,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:58,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:58,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:55:58,579 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:58,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1234705324, now seen corresponding path program 1 times [2024-05-12 11:55:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964725048] [2024-05-12 11:55:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:02,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964725048] [2024-05-12 11:56:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964725048] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:02,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:02,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:56:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646168244] [2024-05-12 11:56:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:02,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:56:02,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:02,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:56:02,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:56:02,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 11:56:02,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:02,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:02,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 11:56:02,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:03,312 INFO L124 PetriNetUnfolderBase]: 2998/4406 cut-off events. [2024-05-12 11:56:03,312 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2024-05-12 11:56:03,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9918 conditions, 4406 events. 2998/4406 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 24103 event pairs, 1452 based on Foata normal form. 3/4227 useless extension candidates. Maximal degree in co-relation 9903. Up to 4303 conditions per place. [2024-05-12 11:56:03,334 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 53 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2024-05-12 11:56:03,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 319 flow [2024-05-12 11:56:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:56:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:56:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-05-12 11:56:03,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6436170212765957 [2024-05-12 11:56:03,341 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 129 flow. Second operand 4 states and 121 transitions. [2024-05-12 11:56:03,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 319 flow [2024-05-12 11:56:03,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:56:03,344 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 175 flow [2024-05-12 11:56:03,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-05-12 11:56:03,348 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-05-12 11:56:03,348 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 175 flow [2024-05-12 11:56:03,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:03,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:03,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:03,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:56:03,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:03,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash -378839472, now seen corresponding path program 1 times [2024-05-12 11:56:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:03,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460326368] [2024-05-12 11:56:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:06,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:06,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460326368] [2024-05-12 11:56:06,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460326368] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:06,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:06,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:56:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462968795] [2024-05-12 11:56:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:06,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:56:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:06,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:56:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:56:06,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 11:56:06,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:06,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:06,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 11:56:06,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:07,976 INFO L124 PetriNetUnfolderBase]: 3057/4518 cut-off events. [2024-05-12 11:56:07,977 INFO L125 PetriNetUnfolderBase]: For 1732/1732 co-relation queries the response was YES. [2024-05-12 11:56:07,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11240 conditions, 4518 events. 3057/4518 cut-off events. For 1732/1732 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 24576 event pairs, 871 based on Foata normal form. 7/4327 useless extension candidates. Maximal degree in co-relation 11223. Up to 4167 conditions per place. [2024-05-12 11:56:08,002 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 73 selfloop transitions, 21 changer transitions 0/105 dead transitions. [2024-05-12 11:56:08,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 531 flow [2024-05-12 11:56:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:56:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:56:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-05-12 11:56:08,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851063829787234 [2024-05-12 11:56:08,005 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 175 flow. Second operand 5 states and 161 transitions. [2024-05-12 11:56:08,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 531 flow [2024-05-12 11:56:08,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 105 transitions, 512 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 11:56:08,010 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 304 flow [2024-05-12 11:56:08,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2024-05-12 11:56:08,011 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-05-12 11:56:08,012 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 304 flow [2024-05-12 11:56:08,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:08,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:08,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:08,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:56:08,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:08,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:08,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1007525327, now seen corresponding path program 1 times [2024-05-12 11:56:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:08,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958734824] [2024-05-12 11:56:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:08,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958734824] [2024-05-12 11:56:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958734824] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:56:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106218053] [2024-05-12 11:56:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:11,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:56:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:11,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:56:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:56:11,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 11:56:11,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-05-12 11:56:11,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:11,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 11:56:11,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:12,751 INFO L124 PetriNetUnfolderBase]: 3299/4864 cut-off events. [2024-05-12 11:56:12,752 INFO L125 PetriNetUnfolderBase]: For 4683/4683 co-relation queries the response was YES. [2024-05-12 11:56:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14532 conditions, 4864 events. 3299/4864 cut-off events. For 4683/4683 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 26639 event pairs, 544 based on Foata normal form. 26/4624 useless extension candidates. Maximal degree in co-relation 14512. Up to 4211 conditions per place. [2024-05-12 11:56:12,785 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 85 selfloop transitions, 24 changer transitions 0/120 dead transitions. [2024-05-12 11:56:12,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 120 transitions, 686 flow [2024-05-12 11:56:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:56:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:56:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-05-12 11:56:12,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6737588652482269 [2024-05-12 11:56:12,789 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 304 flow. Second operand 6 states and 190 transitions. [2024-05-12 11:56:12,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 120 transitions, 686 flow [2024-05-12 11:56:12,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 120 transitions, 674 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-05-12 11:56:12,797 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 371 flow [2024-05-12 11:56:12,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2024-05-12 11:56:12,798 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2024-05-12 11:56:12,798 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 371 flow [2024-05-12 11:56:12,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-05-12 11:56:12,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:12,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:12,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:56:12,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:12,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 338095028, now seen corresponding path program 1 times [2024-05-12 11:56:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838388841] [2024-05-12 11:56:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:21,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:21,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838388841] [2024-05-12 11:56:21,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838388841] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:21,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:21,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:56:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491265847] [2024-05-12 11:56:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:21,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:56:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:56:21,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:56:21,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 11:56:21,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-05-12 11:56:21,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:21,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 11:56:21,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:23,242 INFO L124 PetriNetUnfolderBase]: 3263/4999 cut-off events. [2024-05-12 11:56:23,245 INFO L125 PetriNetUnfolderBase]: For 6603/6603 co-relation queries the response was YES. [2024-05-12 11:56:23,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15955 conditions, 4999 events. 3263/4999 cut-off events. For 6603/6603 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 28478 event pairs, 885 based on Foata normal form. 4/4712 useless extension candidates. Maximal degree in co-relation 15932. Up to 4658 conditions per place. [2024-05-12 11:56:23,272 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 68 selfloop transitions, 10 changer transitions 0/89 dead transitions. [2024-05-12 11:56:23,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 577 flow [2024-05-12 11:56:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:56:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:56:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-05-12 11:56:23,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5659574468085107 [2024-05-12 11:56:23,277 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 371 flow. Second operand 5 states and 133 transitions. [2024-05-12 11:56:23,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 577 flow [2024-05-12 11:56:23,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 516 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 11:56:23,285 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 339 flow [2024-05-12 11:56:23,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-05-12 11:56:23,286 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-05-12 11:56:23,287 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 339 flow [2024-05-12 11:56:23,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-05-12 11:56:23,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:23,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:23,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:56:23,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:23,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1870941109, now seen corresponding path program 1 times [2024-05-12 11:56:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937920818] [2024-05-12 11:56:23,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:23,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:23,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937920818] [2024-05-12 11:56:23,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937920818] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:23,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:23,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:56:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391018407] [2024-05-12 11:56:23,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:23,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:56:23,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:23,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:56:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:56:23,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 47 [2024-05-12 11:56:23,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:23,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:23,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 47 [2024-05-12 11:56:23,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:23,854 INFO L124 PetriNetUnfolderBase]: 1042/2127 cut-off events. [2024-05-12 11:56:23,854 INFO L125 PetriNetUnfolderBase]: For 2377/2593 co-relation queries the response was YES. [2024-05-12 11:56:23,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5152 conditions, 2127 events. 1042/2127 cut-off events. For 2377/2593 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15556 event pairs, 225 based on Foata normal form. 3/1967 useless extension candidates. Maximal degree in co-relation 5127. Up to 1140 conditions per place. [2024-05-12 11:56:23,865 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 27 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2024-05-12 11:56:23,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 369 flow [2024-05-12 11:56:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:56:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:56:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-05-12 11:56:23,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.723404255319149 [2024-05-12 11:56:23,867 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 339 flow. Second operand 3 states and 102 transitions. [2024-05-12 11:56:23,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 369 flow [2024-05-12 11:56:23,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 347 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 11:56:23,869 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 277 flow [2024-05-12 11:56:23,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2024-05-12 11:56:23,872 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-05-12 11:56:23,872 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 277 flow [2024-05-12 11:56:23,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:23,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:23,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:23,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:56:23,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:23,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2138274989, now seen corresponding path program 1 times [2024-05-12 11:56:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342096975] [2024-05-12 11:56:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:32,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:32,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342096975] [2024-05-12 11:56:32,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342096975] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:32,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:32,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:56:32,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970906122] [2024-05-12 11:56:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:32,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:56:32,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:56:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:56:32,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:56:32,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 277 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:32,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:32,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:56:32,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:34,141 INFO L124 PetriNetUnfolderBase]: 3488/5234 cut-off events. [2024-05-12 11:56:34,141 INFO L125 PetriNetUnfolderBase]: For 9074/9074 co-relation queries the response was YES. [2024-05-12 11:56:34,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16041 conditions, 5234 events. 3488/5234 cut-off events. For 9074/9074 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 29182 event pairs, 798 based on Foata normal form. 8/5227 useless extension candidates. Maximal degree in co-relation 16018. Up to 4567 conditions per place. [2024-05-12 11:56:34,165 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 80 selfloop transitions, 30 changer transitions 5/125 dead transitions. [2024-05-12 11:56:34,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 125 transitions, 757 flow [2024-05-12 11:56:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:56:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:56:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-05-12 11:56:34,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5835866261398176 [2024-05-12 11:56:34,167 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 277 flow. Second operand 7 states and 192 transitions. [2024-05-12 11:56:34,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 125 transitions, 757 flow [2024-05-12 11:56:34,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:56:34,173 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 454 flow [2024-05-12 11:56:34,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=454, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2024-05-12 11:56:34,174 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2024-05-12 11:56:34,174 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 454 flow [2024-05-12 11:56:34,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:34,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:34,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:34,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:56:34,175 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:34,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1944878465, now seen corresponding path program 2 times [2024-05-12 11:56:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719499793] [2024-05-12 11:56:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:42,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719499793] [2024-05-12 11:56:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719499793] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:42,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:56:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184875296] [2024-05-12 11:56:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:42,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:56:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:42,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:56:42,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:56:42,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:56:42,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 454 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:42,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:42,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:56:42,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:44,141 INFO L124 PetriNetUnfolderBase]: 3126/4727 cut-off events. [2024-05-12 11:56:44,141 INFO L125 PetriNetUnfolderBase]: For 9930/9932 co-relation queries the response was YES. [2024-05-12 11:56:44,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15641 conditions, 4727 events. 3126/4727 cut-off events. For 9930/9932 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 26242 event pairs, 730 based on Foata normal form. 12/4722 useless extension candidates. Maximal degree in co-relation 15614. Up to 4038 conditions per place. [2024-05-12 11:56:44,163 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 72 selfloop transitions, 34 changer transitions 0/116 dead transitions. [2024-05-12 11:56:44,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 844 flow [2024-05-12 11:56:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:56:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:56:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-05-12 11:56:44,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5602836879432624 [2024-05-12 11:56:44,165 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 454 flow. Second operand 6 states and 158 transitions. [2024-05-12 11:56:44,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 844 flow [2024-05-12 11:56:44,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 116 transitions, 805 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 11:56:44,173 INFO L231 Difference]: Finished difference. Result has 73 places, 80 transitions, 554 flow [2024-05-12 11:56:44,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=73, PETRI_TRANSITIONS=80} [2024-05-12 11:56:44,174 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2024-05-12 11:56:44,174 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 80 transitions, 554 flow [2024-05-12 11:56:44,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:44,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:44,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:44,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:56:44,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:44,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1508164525, now seen corresponding path program 3 times [2024-05-12 11:56:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345281275] [2024-05-12 11:56:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:44,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:53,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:53,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345281275] [2024-05-12 11:56:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345281275] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:53,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:53,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:56:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12461631] [2024-05-12 11:56:53,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:53,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:56:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:56:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:56:53,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:56:53,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 80 transitions, 554 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:53,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:53,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:56:53,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:55,473 INFO L124 PetriNetUnfolderBase]: 3084/4641 cut-off events. [2024-05-12 11:56:55,473 INFO L125 PetriNetUnfolderBase]: For 11825/11827 co-relation queries the response was YES. [2024-05-12 11:56:55,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15754 conditions, 4641 events. 3084/4641 cut-off events. For 11825/11827 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 25519 event pairs, 710 based on Foata normal form. 6/4635 useless extension candidates. Maximal degree in co-relation 15726. Up to 3982 conditions per place. [2024-05-12 11:56:55,537 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 86 selfloop transitions, 36 changer transitions 0/132 dead transitions. [2024-05-12 11:56:55,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 132 transitions, 952 flow [2024-05-12 11:56:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:56:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:56:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-05-12 11:56:55,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2024-05-12 11:56:55,539 INFO L175 Difference]: Start difference. First operand has 73 places, 80 transitions, 554 flow. Second operand 8 states and 204 transitions. [2024-05-12 11:56:55,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 132 transitions, 952 flow [2024-05-12 11:56:55,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 132 transitions, 899 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 11:56:55,562 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 583 flow [2024-05-12 11:56:55,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=583, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2024-05-12 11:56:55,563 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-05-12 11:56:55,563 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 583 flow [2024-05-12 11:56:55,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:55,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:55,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:55,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:56:55,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:55,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -117736677, now seen corresponding path program 1 times [2024-05-12 11:56:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:55,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946973913] [2024-05-12 11:56:55,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:04,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946973913] [2024-05-12 11:57:04,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946973913] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:04,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:04,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:57:04,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130169588] [2024-05-12 11:57:04,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:04,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:57:04,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:04,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:57:04,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:57:04,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 11:57:04,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 583 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:04,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:04,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 11:57:04,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:05,525 INFO L124 PetriNetUnfolderBase]: 2646/4199 cut-off events. [2024-05-12 11:57:05,525 INFO L125 PetriNetUnfolderBase]: For 11376/11378 co-relation queries the response was YES. [2024-05-12 11:57:05,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14147 conditions, 4199 events. 2646/4199 cut-off events. For 11376/11378 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 24274 event pairs, 685 based on Foata normal form. 4/4187 useless extension candidates. Maximal degree in co-relation 14118. Up to 3773 conditions per place. [2024-05-12 11:57:05,548 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 97 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2024-05-12 11:57:05,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 942 flow [2024-05-12 11:57:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:57:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:57:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 11:57:05,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5349544072948328 [2024-05-12 11:57:05,557 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 583 flow. Second operand 7 states and 176 transitions. [2024-05-12 11:57:05,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 942 flow [2024-05-12 11:57:05,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 820 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-05-12 11:57:05,568 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 543 flow [2024-05-12 11:57:05,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=543, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2024-05-12 11:57:05,569 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-05-12 11:57:05,569 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 543 flow [2024-05-12 11:57:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:05,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:05,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:05,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:57:05,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:05,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:05,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1618370634, now seen corresponding path program 1 times [2024-05-12 11:57:05,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957790675] [2024-05-12 11:57:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:14,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:14,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957790675] [2024-05-12 11:57:14,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957790675] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:14,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:57:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552181459] [2024-05-12 11:57:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:14,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:57:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:14,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:57:14,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:57:14,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 11:57:14,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:14,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:14,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 11:57:14,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:15,992 INFO L124 PetriNetUnfolderBase]: 2648/4536 cut-off events. [2024-05-12 11:57:15,993 INFO L125 PetriNetUnfolderBase]: For 10513/10515 co-relation queries the response was YES. [2024-05-12 11:57:16,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14541 conditions, 4536 events. 2648/4536 cut-off events. For 10513/10515 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 29021 event pairs, 981 based on Foata normal form. 1/4431 useless extension candidates. Maximal degree in co-relation 14510. Up to 3837 conditions per place. [2024-05-12 11:57:16,019 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 86 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2024-05-12 11:57:16,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 824 flow [2024-05-12 11:57:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:57:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:57:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-05-12 11:57:16,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5148936170212766 [2024-05-12 11:57:16,021 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 543 flow. Second operand 5 states and 121 transitions. [2024-05-12 11:57:16,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 824 flow [2024-05-12 11:57:16,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 106 transitions, 785 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 11:57:16,065 INFO L231 Difference]: Finished difference. Result has 80 places, 92 transitions, 598 flow [2024-05-12 11:57:16,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=598, PETRI_PLACES=80, PETRI_TRANSITIONS=92} [2024-05-12 11:57:16,067 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-05-12 11:57:16,067 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 92 transitions, 598 flow [2024-05-12 11:57:16,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:16,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:16,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:16,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:57:16,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:16,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1285844150, now seen corresponding path program 1 times [2024-05-12 11:57:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371002713] [2024-05-12 11:57:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:26,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371002713] [2024-05-12 11:57:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371002713] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:26,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:26,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:57:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064986277] [2024-05-12 11:57:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:26,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:57:26,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:26,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:57:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:57:26,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:57:26,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 92 transitions, 598 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:26,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:26,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:57:26,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:28,082 INFO L124 PetriNetUnfolderBase]: 3368/5470 cut-off events. [2024-05-12 11:57:28,082 INFO L125 PetriNetUnfolderBase]: For 16917/16919 co-relation queries the response was YES. [2024-05-12 11:57:28,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18766 conditions, 5470 events. 3368/5470 cut-off events. For 16917/16919 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33295 event pairs, 623 based on Foata normal form. 16/5350 useless extension candidates. Maximal degree in co-relation 18733. Up to 3533 conditions per place. [2024-05-12 11:57:28,110 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 98 selfloop transitions, 36 changer transitions 0/144 dead transitions. [2024-05-12 11:57:28,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 144 transitions, 1078 flow [2024-05-12 11:57:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:57:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:57:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-05-12 11:57:28,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683890577507599 [2024-05-12 11:57:28,112 INFO L175 Difference]: Start difference. First operand has 80 places, 92 transitions, 598 flow. Second operand 7 states and 187 transitions. [2024-05-12 11:57:28,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 144 transitions, 1078 flow [2024-05-12 11:57:28,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 144 transitions, 1055 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-05-12 11:57:28,124 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 679 flow [2024-05-12 11:57:28,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=679, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2024-05-12 11:57:28,125 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2024-05-12 11:57:28,125 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 94 transitions, 679 flow [2024-05-12 11:57:28,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:28,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:28,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:28,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:57:28,126 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:28,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1288701110, now seen corresponding path program 2 times [2024-05-12 11:57:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939575012] [2024-05-12 11:57:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:38,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939575012] [2024-05-12 11:57:38,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939575012] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:38,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:57:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833947899] [2024-05-12 11:57:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:38,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:57:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:57:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:57:38,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:57:38,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 94 transitions, 679 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:38,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:38,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:57:38,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:40,488 INFO L124 PetriNetUnfolderBase]: 3482/5709 cut-off events. [2024-05-12 11:57:40,488 INFO L125 PetriNetUnfolderBase]: For 21100/21102 co-relation queries the response was YES. [2024-05-12 11:57:40,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20209 conditions, 5709 events. 3482/5709 cut-off events. For 21100/21102 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 35421 event pairs, 906 based on Foata normal form. 24/5577 useless extension candidates. Maximal degree in co-relation 20174. Up to 4280 conditions per place. [2024-05-12 11:57:40,535 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 92 selfloop transitions, 40 changer transitions 0/142 dead transitions. [2024-05-12 11:57:40,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 142 transitions, 1111 flow [2024-05-12 11:57:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:57:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:57:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-05-12 11:57:40,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5592705167173252 [2024-05-12 11:57:40,562 INFO L175 Difference]: Start difference. First operand has 85 places, 94 transitions, 679 flow. Second operand 7 states and 184 transitions. [2024-05-12 11:57:40,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 142 transitions, 1111 flow [2024-05-12 11:57:40,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 142 transitions, 1066 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 11:57:40,585 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 750 flow [2024-05-12 11:57:40,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=750, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2024-05-12 11:57:40,586 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2024-05-12 11:57:40,586 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 750 flow [2024-05-12 11:57:40,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:40,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:40,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:40,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:57:40,587 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:40,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1849958713, now seen corresponding path program 1 times [2024-05-12 11:57:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798018824] [2024-05-12 11:57:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798018824] [2024-05-12 11:57:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798018824] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:57:50,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318432561] [2024-05-12 11:57:50,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:50,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:57:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:57:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:57:50,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:57:50,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 750 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:50,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:50,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:57:50,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:51,672 INFO L124 PetriNetUnfolderBase]: 3499/5837 cut-off events. [2024-05-12 11:57:51,673 INFO L125 PetriNetUnfolderBase]: For 23031/23037 co-relation queries the response was YES. [2024-05-12 11:57:51,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21279 conditions, 5837 events. 3499/5837 cut-off events. For 23031/23037 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 37763 event pairs, 1279 based on Foata normal form. 7/5701 useless extension candidates. Maximal degree in co-relation 21242. Up to 5064 conditions per place. [2024-05-12 11:57:51,707 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 105 selfloop transitions, 15 changer transitions 0/130 dead transitions. [2024-05-12 11:57:51,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 130 transitions, 1151 flow [2024-05-12 11:57:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:57:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:57:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-05-12 11:57:51,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2024-05-12 11:57:51,709 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 750 flow. Second operand 6 states and 143 transitions. [2024-05-12 11:57:51,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 130 transitions, 1151 flow [2024-05-12 11:57:51,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 130 transitions, 1059 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 11:57:51,734 INFO L231 Difference]: Finished difference. Result has 91 places, 105 transitions, 797 flow [2024-05-12 11:57:51,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=91, PETRI_TRANSITIONS=105} [2024-05-12 11:57:51,735 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2024-05-12 11:57:51,735 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 797 flow [2024-05-12 11:57:51,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:51,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:51,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:51,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:57:51,735 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:51,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 56777008, now seen corresponding path program 1 times [2024-05-12 11:57:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:51,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045912282] [2024-05-12 11:57:51,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:51,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045912282] [2024-05-12 11:58:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045912282] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962461744] [2024-05-12 11:58:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:00,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:00,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:58:00,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 797 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:00,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:00,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:58:00,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:02,516 INFO L124 PetriNetUnfolderBase]: 3578/5867 cut-off events. [2024-05-12 11:58:02,516 INFO L125 PetriNetUnfolderBase]: For 24365/24367 co-relation queries the response was YES. [2024-05-12 11:58:02,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22053 conditions, 5867 events. 3578/5867 cut-off events. For 24365/24367 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 36904 event pairs, 1011 based on Foata normal form. 4/5724 useless extension candidates. Maximal degree in co-relation 22014. Up to 4667 conditions per place. [2024-05-12 11:58:02,550 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 102 selfloop transitions, 62 changer transitions 0/174 dead transitions. [2024-05-12 11:58:02,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 174 transitions, 1481 flow [2024-05-12 11:58:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:58:02,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372340425531915 [2024-05-12 11:58:02,552 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 797 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:58:02,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 174 transitions, 1481 flow [2024-05-12 11:58:02,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 174 transitions, 1445 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 11:58:02,577 INFO L231 Difference]: Finished difference. Result has 97 places, 124 transitions, 1099 flow [2024-05-12 11:58:02,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1099, PETRI_PLACES=97, PETRI_TRANSITIONS=124} [2024-05-12 11:58:02,577 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2024-05-12 11:58:02,577 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 124 transitions, 1099 flow [2024-05-12 11:58:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:02,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:02,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:02,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:58:02,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:02,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1475768838, now seen corresponding path program 2 times [2024-05-12 11:58:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700476377] [2024-05-12 11:58:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:11,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700476377] [2024-05-12 11:58:11,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700476377] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:11,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:11,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141820967] [2024-05-12 11:58:11,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:11,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:11,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:58:11,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 124 transitions, 1099 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:11,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:11,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:58:11,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:13,421 INFO L124 PetriNetUnfolderBase]: 3663/6009 cut-off events. [2024-05-12 11:58:13,421 INFO L125 PetriNetUnfolderBase]: For 29263/29265 co-relation queries the response was YES. [2024-05-12 11:58:13,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23850 conditions, 6009 events. 3663/6009 cut-off events. For 29263/29265 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 37965 event pairs, 838 based on Foata normal form. 4/5866 useless extension candidates. Maximal degree in co-relation 23809. Up to 4424 conditions per place. [2024-05-12 11:58:13,458 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 105 selfloop transitions, 69 changer transitions 0/184 dead transitions. [2024-05-12 11:58:13,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 184 transitions, 1747 flow [2024-05-12 11:58:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2024-05-12 11:58:13,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 11:58:13,460 INFO L175 Difference]: Start difference. First operand has 97 places, 124 transitions, 1099 flow. Second operand 8 states and 208 transitions. [2024-05-12 11:58:13,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 184 transitions, 1747 flow [2024-05-12 11:58:13,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 184 transitions, 1652 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-05-12 11:58:13,495 INFO L231 Difference]: Finished difference. Result has 103 places, 129 transitions, 1242 flow [2024-05-12 11:58:13,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1242, PETRI_PLACES=103, PETRI_TRANSITIONS=129} [2024-05-12 11:58:13,495 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 50 predicate places. [2024-05-12 11:58:13,496 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 129 transitions, 1242 flow [2024-05-12 11:58:13,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:13,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:13,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:13,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:58:13,496 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:13,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1712240868, now seen corresponding path program 3 times [2024-05-12 11:58:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:13,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60609386] [2024-05-12 11:58:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60609386] [2024-05-12 11:58:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60609386] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:22,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768492980] [2024-05-12 11:58:22,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:22,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:22,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:22,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:22,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:58:22,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 129 transitions, 1242 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:22,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:22,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:58:22,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:24,722 INFO L124 PetriNetUnfolderBase]: 3655/6024 cut-off events. [2024-05-12 11:58:24,722 INFO L125 PetriNetUnfolderBase]: For 33645/33647 co-relation queries the response was YES. [2024-05-12 11:58:24,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24336 conditions, 6024 events. 3655/6024 cut-off events. For 33645/33647 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 38297 event pairs, 1050 based on Foata normal form. 4/5868 useless extension candidates. Maximal degree in co-relation 24293. Up to 4790 conditions per place. [2024-05-12 11:58:24,756 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 107 selfloop transitions, 62 changer transitions 0/179 dead transitions. [2024-05-12 11:58:24,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 179 transitions, 1763 flow [2024-05-12 11:58:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 11:58:24,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372340425531915 [2024-05-12 11:58:24,758 INFO L175 Difference]: Start difference. First operand has 103 places, 129 transitions, 1242 flow. Second operand 8 states and 202 transitions. [2024-05-12 11:58:24,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 179 transitions, 1763 flow [2024-05-12 11:58:24,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 179 transitions, 1604 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-05-12 11:58:24,799 INFO L231 Difference]: Finished difference. Result has 107 places, 130 transitions, 1237 flow [2024-05-12 11:58:24,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1237, PETRI_PLACES=107, PETRI_TRANSITIONS=130} [2024-05-12 11:58:24,800 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2024-05-12 11:58:24,800 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 130 transitions, 1237 flow [2024-05-12 11:58:24,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:24,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:24,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:24,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:58:24,801 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:24,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash -475974699, now seen corresponding path program 2 times [2024-05-12 11:58:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137762732] [2024-05-12 11:58:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:24,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:34,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:34,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137762732] [2024-05-12 11:58:34,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137762732] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:34,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:34,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:58:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418956481] [2024-05-12 11:58:34,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:34,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:58:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:34,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:58:34,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:58:34,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:58:34,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 130 transitions, 1237 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:34,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:34,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:58:34,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:36,344 INFO L124 PetriNetUnfolderBase]: 3657/6140 cut-off events. [2024-05-12 11:58:36,344 INFO L125 PetriNetUnfolderBase]: For 34600/34610 co-relation queries the response was YES. [2024-05-12 11:58:36,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24350 conditions, 6140 events. 3657/6140 cut-off events. For 34600/34610 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 40237 event pairs, 1215 based on Foata normal form. 11/5998 useless extension candidates. Maximal degree in co-relation 24305. Up to 5283 conditions per place. [2024-05-12 11:58:36,379 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 135 selfloop transitions, 21 changer transitions 0/166 dead transitions. [2024-05-12 11:58:36,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 166 transitions, 1693 flow [2024-05-12 11:58:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:58:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:58:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-05-12 11:58:36,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015197568389058 [2024-05-12 11:58:36,397 INFO L175 Difference]: Start difference. First operand has 107 places, 130 transitions, 1237 flow. Second operand 7 states and 165 transitions. [2024-05-12 11:58:36,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 166 transitions, 1693 flow [2024-05-12 11:58:36,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 166 transitions, 1561 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 11:58:36,440 INFO L231 Difference]: Finished difference. Result has 110 places, 136 transitions, 1214 flow [2024-05-12 11:58:36,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1214, PETRI_PLACES=110, PETRI_TRANSITIONS=136} [2024-05-12 11:58:36,441 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2024-05-12 11:58:36,441 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 136 transitions, 1214 flow [2024-05-12 11:58:36,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:36,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:36,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:36,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:58:36,442 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:36,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash -886437227, now seen corresponding path program 1 times [2024-05-12 11:58:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:36,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627257422] [2024-05-12 11:58:36,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:36,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627257422] [2024-05-12 11:58:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627257422] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:58:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619734074] [2024-05-12 11:58:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:45,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:58:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:58:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:58:45,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 11:58:45,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 136 transitions, 1214 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:45,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:45,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 11:58:45,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:47,511 INFO L124 PetriNetUnfolderBase]: 3436/5887 cut-off events. [2024-05-12 11:58:47,511 INFO L125 PetriNetUnfolderBase]: For 37762/37764 co-relation queries the response was YES. [2024-05-12 11:58:47,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23776 conditions, 5887 events. 3436/5887 cut-off events. For 37762/37764 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 39275 event pairs, 1112 based on Foata normal form. 3/5738 useless extension candidates. Maximal degree in co-relation 23729. Up to 4935 conditions per place. [2024-05-12 11:58:47,548 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 137 selfloop transitions, 13 changer transitions 0/164 dead transitions. [2024-05-12 11:58:47,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 164 transitions, 1634 flow [2024-05-12 11:58:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:58:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:58:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-05-12 11:58:47,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-05-12 11:58:47,550 INFO L175 Difference]: Start difference. First operand has 110 places, 136 transitions, 1214 flow. Second operand 6 states and 146 transitions. [2024-05-12 11:58:47,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 164 transitions, 1634 flow [2024-05-12 11:58:47,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 164 transitions, 1596 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-05-12 11:58:47,588 INFO L231 Difference]: Finished difference. Result has 114 places, 143 transitions, 1281 flow [2024-05-12 11:58:47,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1281, PETRI_PLACES=114, PETRI_TRANSITIONS=143} [2024-05-12 11:58:47,588 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 61 predicate places. [2024-05-12 11:58:47,588 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 143 transitions, 1281 flow [2024-05-12 11:58:47,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:47,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:47,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:47,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:58:47,589 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:47,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash -475968747, now seen corresponding path program 2 times [2024-05-12 11:58:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489324086] [2024-05-12 11:58:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489324086] [2024-05-12 11:58:57,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489324086] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:57,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:58:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007175382] [2024-05-12 11:58:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:57,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:58:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:57,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:58:57,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:58:57,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 11:58:57,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 143 transitions, 1281 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:57,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:57,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 11:58:57,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:58,630 INFO L124 PetriNetUnfolderBase]: 3505/6119 cut-off events. [2024-05-12 11:58:58,631 INFO L125 PetriNetUnfolderBase]: For 41475/41483 co-relation queries the response was YES. [2024-05-12 11:58:58,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25157 conditions, 6119 events. 3505/6119 cut-off events. For 41475/41483 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 41450 event pairs, 1127 based on Foata normal form. 8/5940 useless extension candidates. Maximal degree in co-relation 25107. Up to 4983 conditions per place. [2024-05-12 11:58:58,672 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 133 selfloop transitions, 20 changer transitions 0/167 dead transitions. [2024-05-12 11:58:58,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 167 transitions, 1683 flow [2024-05-12 11:58:58,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:58:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:58:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-05-12 11:58:58,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-05-12 11:58:58,674 INFO L175 Difference]: Start difference. First operand has 114 places, 143 transitions, 1281 flow. Second operand 6 states and 147 transitions. [2024-05-12 11:58:58,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 167 transitions, 1683 flow [2024-05-12 11:58:58,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 167 transitions, 1650 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 11:58:58,720 INFO L231 Difference]: Finished difference. Result has 117 places, 146 transitions, 1325 flow [2024-05-12 11:58:58,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1325, PETRI_PLACES=117, PETRI_TRANSITIONS=146} [2024-05-12 11:58:58,721 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-05-12 11:58:58,721 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 146 transitions, 1325 flow [2024-05-12 11:58:58,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:58,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:58,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:58,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:58:58,722 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:58,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash -475959819, now seen corresponding path program 1 times [2024-05-12 11:58:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494207628] [2024-05-12 11:58:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494207628] [2024-05-12 11:59:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494207628] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:09,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:59:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769840908] [2024-05-12 11:59:09,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:09,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:59:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:09,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:59:09,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:59:09,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:59:09,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 146 transitions, 1325 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:09,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:09,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:59:09,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:11,370 INFO L124 PetriNetUnfolderBase]: 3765/6466 cut-off events. [2024-05-12 11:59:11,370 INFO L125 PetriNetUnfolderBase]: For 44403/44405 co-relation queries the response was YES. [2024-05-12 11:59:11,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26953 conditions, 6466 events. 3765/6466 cut-off events. For 44403/44405 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 43288 event pairs, 1251 based on Foata normal form. 1/6268 useless extension candidates. Maximal degree in co-relation 26902. Up to 5458 conditions per place. [2024-05-12 11:59:11,410 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 148 selfloop transitions, 15 changer transitions 0/173 dead transitions. [2024-05-12 11:59:11,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 173 transitions, 1765 flow [2024-05-12 11:59:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:59:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:59:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-05-12 11:59:11,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2024-05-12 11:59:11,411 INFO L175 Difference]: Start difference. First operand has 117 places, 146 transitions, 1325 flow. Second operand 7 states and 159 transitions. [2024-05-12 11:59:11,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 173 transitions, 1765 flow [2024-05-12 11:59:11,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 173 transitions, 1712 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 11:59:11,484 INFO L231 Difference]: Finished difference. Result has 120 places, 149 transitions, 1346 flow [2024-05-12 11:59:11,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1346, PETRI_PLACES=120, PETRI_TRANSITIONS=149} [2024-05-12 11:59:11,484 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 67 predicate places. [2024-05-12 11:59:11,484 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 149 transitions, 1346 flow [2024-05-12 11:59:11,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:11,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:11,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:11,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:59:11,485 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:11,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2069458173, now seen corresponding path program 1 times [2024-05-12 11:59:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760235208] [2024-05-12 11:59:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:21,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:21,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760235208] [2024-05-12 11:59:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760235208] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:21,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:21,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378376845] [2024-05-12 11:59:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:21,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:21,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:21,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:21,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:21,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:59:21,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 149 transitions, 1346 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:21,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:21,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:59:21,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:22,894 INFO L124 PetriNetUnfolderBase]: 3816/6426 cut-off events. [2024-05-12 11:59:22,894 INFO L125 PetriNetUnfolderBase]: For 48071/48087 co-relation queries the response was YES. [2024-05-12 11:59:22,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27505 conditions, 6426 events. 3816/6426 cut-off events. For 48071/48087 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 42724 event pairs, 1173 based on Foata normal form. 17/6280 useless extension candidates. Maximal degree in co-relation 27453. Up to 5328 conditions per place. [2024-05-12 11:59:22,935 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 162 selfloop transitions, 39 changer transitions 0/211 dead transitions. [2024-05-12 11:59:22,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 211 transitions, 2138 flow [2024-05-12 11:59:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:59:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:59:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-05-12 11:59:22,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-05-12 11:59:22,937 INFO L175 Difference]: Start difference. First operand has 120 places, 149 transitions, 1346 flow. Second operand 7 states and 175 transitions. [2024-05-12 11:59:22,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 211 transitions, 2138 flow [2024-05-12 11:59:22,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 211 transitions, 2064 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-05-12 11:59:22,990 INFO L231 Difference]: Finished difference. Result has 123 places, 175 transitions, 1706 flow [2024-05-12 11:59:22,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1706, PETRI_PLACES=123, PETRI_TRANSITIONS=175} [2024-05-12 11:59:22,990 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 70 predicate places. [2024-05-12 11:59:22,991 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 175 transitions, 1706 flow [2024-05-12 11:59:22,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:22,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:22,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:22,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:59:22,991 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:22,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 579814296, now seen corresponding path program 1 times [2024-05-12 11:59:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689392806] [2024-05-12 11:59:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:32,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:32,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689392806] [2024-05-12 11:59:32,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689392806] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:32,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:32,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:32,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261023002] [2024-05-12 11:59:32,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:32,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:32,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:32,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:32,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:32,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:59:32,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 175 transitions, 1706 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:32,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:32,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:59:32,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:34,384 INFO L124 PetriNetUnfolderBase]: 4081/6892 cut-off events. [2024-05-12 11:59:34,384 INFO L125 PetriNetUnfolderBase]: For 59107/59109 co-relation queries the response was YES. [2024-05-12 11:59:34,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31570 conditions, 6892 events. 4081/6892 cut-off events. For 59107/59109 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 46284 event pairs, 1163 based on Foata normal form. 12/6729 useless extension candidates. Maximal degree in co-relation 31516. Up to 4811 conditions per place. [2024-05-12 11:59:34,430 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 150 selfloop transitions, 78 changer transitions 0/238 dead transitions. [2024-05-12 11:59:34,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 238 transitions, 2484 flow [2024-05-12 11:59:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:59:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:59:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-05-12 11:59:34,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.550531914893617 [2024-05-12 11:59:34,432 INFO L175 Difference]: Start difference. First operand has 123 places, 175 transitions, 1706 flow. Second operand 8 states and 207 transitions. [2024-05-12 11:59:34,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 238 transitions, 2484 flow [2024-05-12 11:59:34,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 238 transitions, 2404 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-05-12 11:59:34,502 INFO L231 Difference]: Finished difference. Result has 130 places, 184 transitions, 1961 flow [2024-05-12 11:59:34,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1961, PETRI_PLACES=130, PETRI_TRANSITIONS=184} [2024-05-12 11:59:34,503 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 77 predicate places. [2024-05-12 11:59:34,503 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 184 transitions, 1961 flow [2024-05-12 11:59:34,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:34,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:34,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:34,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:59:34,504 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:34,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:34,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1514143837, now seen corresponding path program 2 times [2024-05-12 11:59:34,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:34,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129600053] [2024-05-12 11:59:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:34,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:44,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129600053] [2024-05-12 11:59:44,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129600053] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:44,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:44,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859865176] [2024-05-12 11:59:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:44,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:44,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:44,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:44,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:59:44,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 184 transitions, 1961 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:44,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:44,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:59:44,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:46,331 INFO L124 PetriNetUnfolderBase]: 4216/7135 cut-off events. [2024-05-12 11:59:46,331 INFO L125 PetriNetUnfolderBase]: For 66962/66970 co-relation queries the response was YES. [2024-05-12 11:59:46,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33932 conditions, 7135 events. 4216/7135 cut-off events. For 66962/66970 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 48597 event pairs, 1274 based on Foata normal form. 7/6961 useless extension candidates. Maximal degree in co-relation 33875. Up to 5775 conditions per place. [2024-05-12 11:59:46,387 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 172 selfloop transitions, 42 changer transitions 0/224 dead transitions. [2024-05-12 11:59:46,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 224 transitions, 2639 flow [2024-05-12 11:59:46,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:59:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:59:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:59:46,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258358662613982 [2024-05-12 11:59:46,389 INFO L175 Difference]: Start difference. First operand has 130 places, 184 transitions, 1961 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:59:46,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 224 transitions, 2639 flow [2024-05-12 11:59:46,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 224 transitions, 2549 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 11:59:46,475 INFO L231 Difference]: Finished difference. Result has 134 places, 192 transitions, 2074 flow [2024-05-12 11:59:46,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2074, PETRI_PLACES=134, PETRI_TRANSITIONS=192} [2024-05-12 11:59:46,475 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 81 predicate places. [2024-05-12 11:59:46,475 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 192 transitions, 2074 flow [2024-05-12 11:59:46,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:46,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:46,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:46,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:59:46,476 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:46,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1294440292, now seen corresponding path program 1 times [2024-05-12 11:59:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:46,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463953228] [2024-05-12 11:59:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463953228] [2024-05-12 11:59:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463953228] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:56,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618510616] [2024-05-12 11:59:56,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:56,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:56,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:56,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:56,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 11:59:56,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 192 transitions, 2074 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:56,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:56,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 11:59:56,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:58,211 INFO L124 PetriNetUnfolderBase]: 4233/7155 cut-off events. [2024-05-12 11:59:58,211 INFO L125 PetriNetUnfolderBase]: For 73157/73171 co-relation queries the response was YES. [2024-05-12 11:59:58,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35123 conditions, 7155 events. 4233/7155 cut-off events. For 73157/73171 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 48504 event pairs, 1288 based on Foata normal form. 15/6988 useless extension candidates. Maximal degree in co-relation 35065. Up to 6121 conditions per place. [2024-05-12 11:59:58,269 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 197 selfloop transitions, 18 changer transitions 0/225 dead transitions. [2024-05-12 11:59:58,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 225 transitions, 2664 flow [2024-05-12 11:59:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:59:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:59:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-05-12 11:59:58,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49848024316109424 [2024-05-12 11:59:58,270 INFO L175 Difference]: Start difference. First operand has 134 places, 192 transitions, 2074 flow. Second operand 7 states and 164 transitions. [2024-05-12 11:59:58,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 225 transitions, 2664 flow [2024-05-12 11:59:58,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 225 transitions, 2590 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-05-12 11:59:58,372 INFO L231 Difference]: Finished difference. Result has 138 places, 195 transitions, 2094 flow [2024-05-12 11:59:58,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2094, PETRI_PLACES=138, PETRI_TRANSITIONS=195} [2024-05-12 11:59:58,373 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 85 predicate places. [2024-05-12 11:59:58,373 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 195 transitions, 2094 flow [2024-05-12 11:59:58,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:58,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:58,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:58,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:59:58,374 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:58,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:58,374 INFO L85 PathProgramCache]: Analyzing trace with hash -815940758, now seen corresponding path program 2 times [2024-05-12 11:59:58,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981605968] [2024-05-12 11:59:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:08,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981605968] [2024-05-12 12:00:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981605968] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:08,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:08,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:00:08,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283483699] [2024-05-12 12:00:08,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:08,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:00:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:08,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:00:08,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:00:08,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:00:08,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 195 transitions, 2094 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:08,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:08,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:00:08,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:10,761 INFO L124 PetriNetUnfolderBase]: 4213/7247 cut-off events. [2024-05-12 12:00:10,762 INFO L125 PetriNetUnfolderBase]: For 77520/77522 co-relation queries the response was YES. [2024-05-12 12:00:10,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35393 conditions, 7247 events. 4213/7247 cut-off events. For 77520/77522 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 49564 event pairs, 826 based on Foata normal form. 12/7048 useless extension candidates. Maximal degree in co-relation 35333. Up to 4161 conditions per place. [2024-05-12 12:00:10,820 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 152 selfloop transitions, 78 changer transitions 0/240 dead transitions. [2024-05-12 12:00:10,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 240 transitions, 2742 flow [2024-05-12 12:00:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:00:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:00:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-05-12 12:00:10,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5592705167173252 [2024-05-12 12:00:10,822 INFO L175 Difference]: Start difference. First operand has 138 places, 195 transitions, 2094 flow. Second operand 7 states and 184 transitions. [2024-05-12 12:00:10,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 240 transitions, 2742 flow [2024-05-12 12:00:10,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 240 transitions, 2664 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-05-12 12:00:10,909 INFO L231 Difference]: Finished difference. Result has 140 places, 195 transitions, 2181 flow [2024-05-12 12:00:10,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2181, PETRI_PLACES=140, PETRI_TRANSITIONS=195} [2024-05-12 12:00:10,910 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 87 predicate places. [2024-05-12 12:00:10,910 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 195 transitions, 2181 flow [2024-05-12 12:00:10,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:10,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:10,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:10,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:00:10,911 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:10,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash 699392988, now seen corresponding path program 3 times [2024-05-12 12:00:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:10,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142732443] [2024-05-12 12:00:10,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:10,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142732443] [2024-05-12 12:00:20,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142732443] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:20,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:20,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:00:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289243207] [2024-05-12 12:00:20,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:20,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:00:20,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:00:20,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:00:20,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:00:20,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 195 transitions, 2181 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:20,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:20,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:00:20,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:23,023 INFO L124 PetriNetUnfolderBase]: 4193/7165 cut-off events. [2024-05-12 12:00:23,023 INFO L125 PetriNetUnfolderBase]: For 80692/80694 co-relation queries the response was YES. [2024-05-12 12:00:23,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35768 conditions, 7165 events. 4193/7165 cut-off events. For 80692/80694 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 48401 event pairs, 690 based on Foata normal form. 12/6967 useless extension candidates. Maximal degree in co-relation 35707. Up to 3923 conditions per place. [2024-05-12 12:00:23,094 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 150 selfloop transitions, 75 changer transitions 0/235 dead transitions. [2024-05-12 12:00:23,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 235 transitions, 2773 flow [2024-05-12 12:00:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:00:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:00:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 12:00:23,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5349544072948328 [2024-05-12 12:00:23,096 INFO L175 Difference]: Start difference. First operand has 140 places, 195 transitions, 2181 flow. Second operand 7 states and 176 transitions. [2024-05-12 12:00:23,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 235 transitions, 2773 flow [2024-05-12 12:00:23,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 235 transitions, 2577 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:00:23,185 INFO L231 Difference]: Finished difference. Result has 140 places, 194 transitions, 2107 flow [2024-05-12 12:00:23,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1953, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2107, PETRI_PLACES=140, PETRI_TRANSITIONS=194} [2024-05-12 12:00:23,186 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 87 predicate places. [2024-05-12 12:00:23,186 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 194 transitions, 2107 flow [2024-05-12 12:00:23,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:23,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:23,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:23,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:00:23,187 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:23,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1869866490, now seen corresponding path program 2 times [2024-05-12 12:00:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669728647] [2024-05-12 12:00:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:33,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:33,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669728647] [2024-05-12 12:00:33,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669728647] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:33,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:33,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:00:33,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187311107] [2024-05-12 12:00:33,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:33,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:00:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:00:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:00:33,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:00:33,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 194 transitions, 2107 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:33,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:33,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:00:33,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:35,491 INFO L124 PetriNetUnfolderBase]: 4210/7346 cut-off events. [2024-05-12 12:00:35,491 INFO L125 PetriNetUnfolderBase]: For 77549/77551 co-relation queries the response was YES. [2024-05-12 12:00:35,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35835 conditions, 7346 events. 4210/7346 cut-off events. For 77549/77551 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 51127 event pairs, 1278 based on Foata normal form. 1/7104 useless extension candidates. Maximal degree in co-relation 35773. Up to 6099 conditions per place. [2024-05-12 12:00:35,542 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 196 selfloop transitions, 15 changer transitions 0/221 dead transitions. [2024-05-12 12:00:35,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 221 transitions, 2675 flow [2024-05-12 12:00:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:00:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:00:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-05-12 12:00:35,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48024316109422494 [2024-05-12 12:00:35,544 INFO L175 Difference]: Start difference. First operand has 140 places, 194 transitions, 2107 flow. Second operand 7 states and 158 transitions. [2024-05-12 12:00:35,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 221 transitions, 2675 flow [2024-05-12 12:00:35,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 221 transitions, 2472 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-05-12 12:00:35,641 INFO L231 Difference]: Finished difference. Result has 141 places, 197 transitions, 1998 flow [2024-05-12 12:00:35,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1998, PETRI_PLACES=141, PETRI_TRANSITIONS=197} [2024-05-12 12:00:35,645 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 88 predicate places. [2024-05-12 12:00:35,645 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 197 transitions, 1998 flow [2024-05-12 12:00:35,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:35,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:35,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:35,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:00:35,646 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:35,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1870312363, now seen corresponding path program 3 times [2024-05-12 12:00:35,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:35,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370441077] [2024-05-12 12:00:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:35,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00: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-05-12 12:00:46,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:46,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370441077] [2024-05-12 12:00:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370441077] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:46,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:00:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131057991] [2024-05-12 12:00:46,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:00:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:00:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:00:47,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:00:47,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 197 transitions, 1998 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:47,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:47,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:00:47,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:48,983 INFO L124 PetriNetUnfolderBase]: 4300/7483 cut-off events. [2024-05-12 12:00:48,983 INFO L125 PetriNetUnfolderBase]: For 80386/80394 co-relation queries the response was YES. [2024-05-12 12:00:49,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35618 conditions, 7483 events. 4300/7483 cut-off events. For 80386/80394 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 52078 event pairs, 1254 based on Foata normal form. 7/7237 useless extension candidates. Maximal degree in co-relation 35556. Up to 5702 conditions per place. [2024-05-12 12:00:49,050 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 177 selfloop transitions, 54 changer transitions 0/241 dead transitions. [2024-05-12 12:00:49,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 241 transitions, 2826 flow [2024-05-12 12:00:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:00:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:00:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 12:00:49,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227963525835866 [2024-05-12 12:00:49,051 INFO L175 Difference]: Start difference. First operand has 141 places, 197 transitions, 1998 flow. Second operand 7 states and 172 transitions. [2024-05-12 12:00:49,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 241 transitions, 2826 flow [2024-05-12 12:00:49,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 241 transitions, 2754 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-05-12 12:00:49,144 INFO L231 Difference]: Finished difference. Result has 145 places, 210 transitions, 2230 flow [2024-05-12 12:00:49,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2230, PETRI_PLACES=145, PETRI_TRANSITIONS=210} [2024-05-12 12:00:49,147 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 92 predicate places. [2024-05-12 12:00:49,147 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 210 transitions, 2230 flow [2024-05-12 12:00:49,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:49,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:49,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:49,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:00:49,148 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:49,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1876258420, now seen corresponding path program 3 times [2024-05-12 12:00:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:49,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245172618] [2024-05-12 12:00:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:00,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:00,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245172618] [2024-05-12 12:01:00,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245172618] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:00,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:00,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:01:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007259664] [2024-05-12 12:01:00,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:00,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:01:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:00,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:01:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:01:00,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:01:00,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 210 transitions, 2230 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:00,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:00,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:01:00,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:02,266 INFO L124 PetriNetUnfolderBase]: 4302/7509 cut-off events. [2024-05-12 12:01:02,267 INFO L125 PetriNetUnfolderBase]: For 90083/90097 co-relation queries the response was YES. [2024-05-12 12:01:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37520 conditions, 7509 events. 4302/7509 cut-off events. For 90083/90097 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 52447 event pairs, 1272 based on Foata normal form. 15/7275 useless extension candidates. Maximal degree in co-relation 37455. Up to 6153 conditions per place. [2024-05-12 12:01:02,332 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 207 selfloop transitions, 31 changer transitions 0/248 dead transitions. [2024-05-12 12:01:02,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 248 transitions, 2904 flow [2024-05-12 12:01:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:01:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:01:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-05-12 12:01:02,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973404255319149 [2024-05-12 12:01:02,334 INFO L175 Difference]: Start difference. First operand has 145 places, 210 transitions, 2230 flow. Second operand 8 states and 187 transitions. [2024-05-12 12:01:02,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 248 transitions, 2904 flow [2024-05-12 12:01:02,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 248 transitions, 2806 flow, removed 35 selfloop flow, removed 2 redundant places. [2024-05-12 12:01:02,453 INFO L231 Difference]: Finished difference. Result has 151 places, 213 transitions, 2268 flow [2024-05-12 12:01:02,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2268, PETRI_PLACES=151, PETRI_TRANSITIONS=213} [2024-05-12 12:01:02,454 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 98 predicate places. [2024-05-12 12:01:02,454 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 213 transitions, 2268 flow [2024-05-12 12:01:02,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:02,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:02,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:02,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:01:02,455 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:02,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1877484895, now seen corresponding path program 1 times [2024-05-12 12:01:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:02,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787044283] [2024-05-12 12:01:02,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:12,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787044283] [2024-05-12 12:01:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787044283] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:12,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:01:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208597433] [2024-05-12 12:01:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:12,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:01:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:01:12,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:01:12,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 12:01:12,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 213 transitions, 2268 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:12,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:12,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 12:01:12,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:14,500 INFO L124 PetriNetUnfolderBase]: 4073/6976 cut-off events. [2024-05-12 12:01:14,500 INFO L125 PetriNetUnfolderBase]: For 94389/94473 co-relation queries the response was YES. [2024-05-12 12:01:14,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35812 conditions, 6976 events. 4073/6976 cut-off events. For 94389/94473 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 48206 event pairs, 1183 based on Foata normal form. 20/6771 useless extension candidates. Maximal degree in co-relation 35745. Up to 5758 conditions per place. [2024-05-12 12:01:14,564 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 209 selfloop transitions, 17 changer transitions 0/246 dead transitions. [2024-05-12 12:01:14,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 246 transitions, 2893 flow [2024-05-12 12:01:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:01:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:01:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-05-12 12:01:14,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 12:01:14,565 INFO L175 Difference]: Start difference. First operand has 151 places, 213 transitions, 2268 flow. Second operand 7 states and 168 transitions. [2024-05-12 12:01:14,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 246 transitions, 2893 flow [2024-05-12 12:01:14,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 246 transitions, 2779 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-05-12 12:01:14,765 INFO L231 Difference]: Finished difference. Result has 153 places, 220 transitions, 2300 flow [2024-05-12 12:01:14,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2154, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2300, PETRI_PLACES=153, PETRI_TRANSITIONS=220} [2024-05-12 12:01:14,765 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 100 predicate places. [2024-05-12 12:01:14,766 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 220 transitions, 2300 flow [2024-05-12 12:01:14,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:14,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:14,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:14,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:01:14,766 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:14,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1869850618, now seen corresponding path program 1 times [2024-05-12 12:01:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074478188] [2024-05-12 12:01:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:25,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:25,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074478188] [2024-05-12 12:01:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074478188] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:25,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:25,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:01:25,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902599894] [2024-05-12 12:01:25,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:25,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:01:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:25,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:01:25,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:01:25,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:01:25,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 220 transitions, 2300 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:25,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:25,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:01:25,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:27,683 INFO L124 PetriNetUnfolderBase]: 4301/7476 cut-off events. [2024-05-12 12:01:27,684 INFO L125 PetriNetUnfolderBase]: For 97640/97642 co-relation queries the response was YES. [2024-05-12 12:01:27,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37676 conditions, 7476 events. 4301/7476 cut-off events. For 97640/97642 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 51926 event pairs, 1286 based on Foata normal form. 2/7240 useless extension candidates. Maximal degree in co-relation 37607. Up to 6189 conditions per place. [2024-05-12 12:01:27,746 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 224 selfloop transitions, 28 changer transitions 0/262 dead transitions. [2024-05-12 12:01:27,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 262 transitions, 3152 flow [2024-05-12 12:01:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:01:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:01:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-05-12 12:01:27,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2024-05-12 12:01:27,748 INFO L175 Difference]: Start difference. First operand has 153 places, 220 transitions, 2300 flow. Second operand 8 states and 180 transitions. [2024-05-12 12:01:27,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 262 transitions, 3152 flow [2024-05-12 12:01:27,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 262 transitions, 3085 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-05-12 12:01:27,869 INFO L231 Difference]: Finished difference. Result has 160 places, 231 transitions, 2549 flow [2024-05-12 12:01:27,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2233, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2549, PETRI_PLACES=160, PETRI_TRANSITIONS=231} [2024-05-12 12:01:27,870 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 107 predicate places. [2024-05-12 12:01:27,870 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 231 transitions, 2549 flow [2024-05-12 12:01:27,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:27,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:27,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:27,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:01:27,871 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:27,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash 296899870, now seen corresponding path program 1 times [2024-05-12 12:01:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:27,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310617717] [2024-05-12 12:01:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310617717] [2024-05-12 12:01:38,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310617717] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:38,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:38,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:01:38,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78034250] [2024-05-12 12:01:38,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:38,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:01:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:38,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:01:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:01:38,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:01:38,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 231 transitions, 2549 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:38,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:38,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:01:38,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:40,707 INFO L124 PetriNetUnfolderBase]: 4352/7376 cut-off events. [2024-05-12 12:01:40,708 INFO L125 PetriNetUnfolderBase]: For 105247/105270 co-relation queries the response was YES. [2024-05-12 12:01:40,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38820 conditions, 7376 events. 4352/7376 cut-off events. For 105247/105270 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 50475 event pairs, 1282 based on Foata normal form. 23/7204 useless extension candidates. Maximal degree in co-relation 38747. Up to 6055 conditions per place. [2024-05-12 12:01:40,781 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 224 selfloop transitions, 43 changer transitions 0/277 dead transitions. [2024-05-12 12:01:40,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 277 transitions, 3325 flow [2024-05-12 12:01:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:01:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:01:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 12:01:40,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523936170212766 [2024-05-12 12:01:40,783 INFO L175 Difference]: Start difference. First operand has 160 places, 231 transitions, 2549 flow. Second operand 8 states and 197 transitions. [2024-05-12 12:01:40,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 277 transitions, 3325 flow [2024-05-12 12:01:40,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 277 transitions, 3136 flow, removed 90 selfloop flow, removed 2 redundant places. [2024-05-12 12:01:40,959 INFO L231 Difference]: Finished difference. Result has 166 places, 235 transitions, 2533 flow [2024-05-12 12:01:40,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2360, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2533, PETRI_PLACES=166, PETRI_TRANSITIONS=235} [2024-05-12 12:01:40,960 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 113 predicate places. [2024-05-12 12:01:40,960 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 235 transitions, 2533 flow [2024-05-12 12:01:40,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:40,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:40,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:40,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:01:40,961 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:40,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash 300443046, now seen corresponding path program 1 times [2024-05-12 12:01:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:40,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864625901] [2024-05-12 12:01:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864625901] [2024-05-12 12:01:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864625901] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:51,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:51,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:01:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993482498] [2024-05-12 12:01:51,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:51,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:01:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:51,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:01:51,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:01:51,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:01:51,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 235 transitions, 2533 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:51,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:51,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:01:51,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:53,638 INFO L124 PetriNetUnfolderBase]: 4420/7479 cut-off events. [2024-05-12 12:01:53,639 INFO L125 PetriNetUnfolderBase]: For 113009/113020 co-relation queries the response was YES. [2024-05-12 12:01:53,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40428 conditions, 7479 events. 4420/7479 cut-off events. For 113009/113020 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 51312 event pairs, 1292 based on Foata normal form. 10/7290 useless extension candidates. Maximal degree in co-relation 40353. Up to 6167 conditions per place. [2024-05-12 12:01:53,716 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 223 selfloop transitions, 40 changer transitions 0/273 dead transitions. [2024-05-12 12:01:53,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 273 transitions, 3249 flow [2024-05-12 12:01:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:01:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:01:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-05-12 12:01:53,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197568389057751 [2024-05-12 12:01:53,720 INFO L175 Difference]: Start difference. First operand has 166 places, 235 transitions, 2533 flow. Second operand 7 states and 171 transitions. [2024-05-12 12:01:53,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 273 transitions, 3249 flow [2024-05-12 12:01:54,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 273 transitions, 3102 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-05-12 12:01:54,036 INFO L231 Difference]: Finished difference. Result has 167 places, 240 transitions, 2547 flow [2024-05-12 12:01:54,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2547, PETRI_PLACES=167, PETRI_TRANSITIONS=240} [2024-05-12 12:01:54,036 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 114 predicate places. [2024-05-12 12:01:54,037 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 240 transitions, 2547 flow [2024-05-12 12:01:54,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:54,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:54,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:54,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:01:54,037 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:54,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1673215846, now seen corresponding path program 2 times [2024-05-12 12:01:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:54,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98917351] [2024-05-12 12:01:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:04,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-05-12 12:02:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98917351] [2024-05-12 12:02:04,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98917351] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:04,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:04,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:02:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206436257] [2024-05-12 12:02:04,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:04,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:02:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:02:04,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:02:04,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:02:04,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 240 transitions, 2547 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:04,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:04,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:02:04,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:06,719 INFO L124 PetriNetUnfolderBase]: 4448/7529 cut-off events. [2024-05-12 12:02:06,719 INFO L125 PetriNetUnfolderBase]: For 115798/115809 co-relation queries the response was YES. [2024-05-12 12:02:06,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40579 conditions, 7529 events. 4448/7529 cut-off events. For 115798/115809 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 51687 event pairs, 1289 based on Foata normal form. 10/7342 useless extension candidates. Maximal degree in co-relation 40503. Up to 6012 conditions per place. [2024-05-12 12:02:06,798 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 216 selfloop transitions, 49 changer transitions 0/275 dead transitions. [2024-05-12 12:02:06,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 275 transitions, 3319 flow [2024-05-12 12:02:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:02:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:02:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 12:02:06,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227963525835866 [2024-05-12 12:02:06,800 INFO L175 Difference]: Start difference. First operand has 167 places, 240 transitions, 2547 flow. Second operand 7 states and 172 transitions. [2024-05-12 12:02:06,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 275 transitions, 3319 flow [2024-05-12 12:02:06,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 275 transitions, 3253 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 12:02:06,959 INFO L231 Difference]: Finished difference. Result has 171 places, 243 transitions, 2640 flow [2024-05-12 12:02:06,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2640, PETRI_PLACES=171, PETRI_TRANSITIONS=243} [2024-05-12 12:02:06,959 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 118 predicate places. [2024-05-12 12:02:06,959 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 243 transitions, 2640 flow [2024-05-12 12:02:06,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:06,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:06,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:06,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:02:06,960 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:06,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -270946206, now seen corresponding path program 2 times [2024-05-12 12:02:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890682334] [2024-05-12 12:02:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890682334] [2024-05-12 12:02:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890682334] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:02:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823599736] [2024-05-12 12:02:17,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:17,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:02:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:02:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:02:18,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:02:18,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 243 transitions, 2640 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:18,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:18,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:02:18,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:20,465 INFO L124 PetriNetUnfolderBase]: 4603/7747 cut-off events. [2024-05-12 12:02:20,465 INFO L125 PetriNetUnfolderBase]: For 126570/126581 co-relation queries the response was YES. [2024-05-12 12:02:20,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42645 conditions, 7747 events. 4603/7747 cut-off events. For 126570/126581 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 53126 event pairs, 1288 based on Foata normal form. 9/7561 useless extension candidates. Maximal degree in co-relation 42568. Up to 5979 conditions per place. [2024-05-12 12:02:20,537 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 223 selfloop transitions, 58 changer transitions 0/291 dead transitions. [2024-05-12 12:02:20,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 291 transitions, 3678 flow [2024-05-12 12:02:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:02:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:02:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 12:02:20,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523936170212766 [2024-05-12 12:02:20,539 INFO L175 Difference]: Start difference. First operand has 171 places, 243 transitions, 2640 flow. Second operand 8 states and 197 transitions. [2024-05-12 12:02:20,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 291 transitions, 3678 flow [2024-05-12 12:02:20,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 291 transitions, 3580 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-05-12 12:02:20,710 INFO L231 Difference]: Finished difference. Result has 176 places, 251 transitions, 2842 flow [2024-05-12 12:02:20,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2542, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2842, PETRI_PLACES=176, PETRI_TRANSITIONS=251} [2024-05-12 12:02:20,711 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 123 predicate places. [2024-05-12 12:02:20,711 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 251 transitions, 2842 flow [2024-05-12 12:02:20,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:20,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:20,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:20,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:02:20,712 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:20,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:20,712 INFO L85 PathProgramCache]: Analyzing trace with hash -270945772, now seen corresponding path program 1 times [2024-05-12 12:02:20,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:20,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785613310] [2024-05-12 12:02:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:33,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785613310] [2024-05-12 12:02:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785613310] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:33,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:02:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558301576] [2024-05-12 12:02:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:33,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:02:33,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:33,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:02:33,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:02:33,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:02:33,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 251 transitions, 2842 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:33,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:33,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:02:33,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:35,791 INFO L124 PetriNetUnfolderBase]: 4620/7798 cut-off events. [2024-05-12 12:02:35,791 INFO L125 PetriNetUnfolderBase]: For 138847/138861 co-relation queries the response was YES. [2024-05-12 12:02:35,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44207 conditions, 7798 events. 4620/7798 cut-off events. For 138847/138861 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 53614 event pairs, 1334 based on Foata normal form. 15/7610 useless extension candidates. Maximal degree in co-relation 44128. Up to 6626 conditions per place. [2024-05-12 12:02:35,859 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 258 selfloop transitions, 21 changer transitions 0/289 dead transitions. [2024-05-12 12:02:35,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 289 transitions, 3610 flow [2024-05-12 12:02:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:02:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:02:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-05-12 12:02:35,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-05-12 12:02:35,862 INFO L175 Difference]: Start difference. First operand has 176 places, 251 transitions, 2842 flow. Second operand 8 states and 184 transitions. [2024-05-12 12:02:35,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 289 transitions, 3610 flow [2024-05-12 12:02:36,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 289 transitions, 3465 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-05-12 12:02:36,048 INFO L231 Difference]: Finished difference. Result has 180 places, 254 transitions, 2819 flow [2024-05-12 12:02:36,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2697, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2819, PETRI_PLACES=180, PETRI_TRANSITIONS=254} [2024-05-12 12:02:36,049 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 127 predicate places. [2024-05-12 12:02:36,049 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 254 transitions, 2819 flow [2024-05-12 12:02:36,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:36,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:36,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:36,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:02:36,050 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:36,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash -270958296, now seen corresponding path program 3 times [2024-05-12 12:02:36,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:36,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585167948] [2024-05-12 12:02:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:36,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585167948] [2024-05-12 12:02:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585167948] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:02:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699184776] [2024-05-12 12:02:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:46,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:02:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:46,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:02:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:02:46,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:02:46,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 254 transitions, 2819 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:46,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:46,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:02:46,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:48,938 INFO L124 PetriNetUnfolderBase]: 4655/7860 cut-off events. [2024-05-12 12:02:48,939 INFO L125 PetriNetUnfolderBase]: For 142687/142698 co-relation queries the response was YES. [2024-05-12 12:02:48,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44626 conditions, 7860 events. 4655/7860 cut-off events. For 142687/142698 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 54258 event pairs, 1307 based on Foata normal form. 9/7663 useless extension candidates. Maximal degree in co-relation 44545. Up to 6035 conditions per place. [2024-05-12 12:02:49,013 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 224 selfloop transitions, 62 changer transitions 0/296 dead transitions. [2024-05-12 12:02:49,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 296 transitions, 3704 flow [2024-05-12 12:02:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:02:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:02:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 12:02:49,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.523936170212766 [2024-05-12 12:02:49,014 INFO L175 Difference]: Start difference. First operand has 180 places, 254 transitions, 2819 flow. Second operand 8 states and 197 transitions. [2024-05-12 12:02:49,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 296 transitions, 3704 flow [2024-05-12 12:02:49,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 296 transitions, 3604 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-05-12 12:02:49,186 INFO L231 Difference]: Finished difference. Result has 182 places, 258 transitions, 2935 flow [2024-05-12 12:02:49,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2719, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2935, PETRI_PLACES=182, PETRI_TRANSITIONS=258} [2024-05-12 12:02:49,187 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 129 predicate places. [2024-05-12 12:02:49,187 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 258 transitions, 2935 flow [2024-05-12 12:02:49,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:49,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:49,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:49,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:02:49,187 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:49,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1360774284, now seen corresponding path program 3 times [2024-05-12 12:02:49,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:49,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387498029] [2024-05-12 12:02:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:59,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:59,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387498029] [2024-05-12 12:02:59,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387498029] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:59,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:59,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:02:59,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423434128] [2024-05-12 12:02:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:59,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:02:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:02:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:02:59,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:02:59,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 258 transitions, 2935 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:59,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:59,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:02:59,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:01,573 INFO L124 PetriNetUnfolderBase]: 4641/7810 cut-off events. [2024-05-12 12:03:01,574 INFO L125 PetriNetUnfolderBase]: For 147555/147557 co-relation queries the response was YES. [2024-05-12 12:03:01,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44981 conditions, 7810 events. 4641/7810 cut-off events. For 147555/147557 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 53526 event pairs, 1355 based on Foata normal form. 4/7609 useless extension candidates. Maximal degree in co-relation 44899. Up to 6498 conditions per place. [2024-05-12 12:03:01,657 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 240 selfloop transitions, 43 changer transitions 0/293 dead transitions. [2024-05-12 12:03:01,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 293 transitions, 3683 flow [2024-05-12 12:03:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-05-12 12:03:01,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-05-12 12:03:01,659 INFO L175 Difference]: Start difference. First operand has 182 places, 258 transitions, 2935 flow. Second operand 8 states and 184 transitions. [2024-05-12 12:03:01,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 293 transitions, 3683 flow [2024-05-12 12:03:01,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 293 transitions, 3514 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-05-12 12:03:01,878 INFO L231 Difference]: Finished difference. Result has 186 places, 260 transitions, 2891 flow [2024-05-12 12:03:01,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2891, PETRI_PLACES=186, PETRI_TRANSITIONS=260} [2024-05-12 12:03:01,879 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 133 predicate places. [2024-05-12 12:03:01,879 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 260 transitions, 2891 flow [2024-05-12 12:03:01,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:01,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:01,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:01,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:03:01,880 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:01,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1743336818, now seen corresponding path program 4 times [2024-05-12 12:03:01,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755062966] [2024-05-12 12:03:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:11,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:11,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755062966] [2024-05-12 12:03:11,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755062966] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:11,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:11,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429807326] [2024-05-12 12:03:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:11,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:11,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:11,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:11,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:12,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:03:12,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 260 transitions, 2891 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:12,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:12,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:03:12,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:14,222 INFO L124 PetriNetUnfolderBase]: 4675/7864 cut-off events. [2024-05-12 12:03:14,222 INFO L125 PetriNetUnfolderBase]: For 149839/149843 co-relation queries the response was YES. [2024-05-12 12:03:14,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44879 conditions, 7864 events. 4675/7864 cut-off events. For 149839/149843 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 54135 event pairs, 1273 based on Foata normal form. 3/7667 useless extension candidates. Maximal degree in co-relation 44795. Up to 6440 conditions per place. [2024-05-12 12:03:14,303 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 246 selfloop transitions, 52 changer transitions 0/308 dead transitions. [2024-05-12 12:03:14,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 308 transitions, 3714 flow [2024-05-12 12:03:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-05-12 12:03:14,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 12:03:14,307 INFO L175 Difference]: Start difference. First operand has 186 places, 260 transitions, 2891 flow. Second operand 9 states and 216 transitions. [2024-05-12 12:03:14,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 308 transitions, 3714 flow [2024-05-12 12:03:14,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 308 transitions, 3548 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-05-12 12:03:14,553 INFO L231 Difference]: Finished difference. Result has 189 places, 264 transitions, 2914 flow [2024-05-12 12:03:14,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2725, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2914, PETRI_PLACES=189, PETRI_TRANSITIONS=264} [2024-05-12 12:03:14,562 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 136 predicate places. [2024-05-12 12:03:14,562 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 264 transitions, 2914 flow [2024-05-12 12:03:14,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:14,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:14,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:14,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:03:14,564 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:14,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash 622716876, now seen corresponding path program 5 times [2024-05-12 12:03:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:14,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243577399] [2024-05-12 12:03:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:25,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243577399] [2024-05-12 12:03:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243577399] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:25,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:25,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175989091] [2024-05-12 12:03:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:25,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:25,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:03:25,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 264 transitions, 2914 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:25,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:25,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:03:25,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:27,814 INFO L124 PetriNetUnfolderBase]: 4709/8132 cut-off events. [2024-05-12 12:03:27,815 INFO L125 PetriNetUnfolderBase]: For 155219/155232 co-relation queries the response was YES. [2024-05-12 12:03:27,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45674 conditions, 8132 events. 4709/8132 cut-off events. For 155219/155232 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 57135 event pairs, 1228 based on Foata normal form. 9/7888 useless extension candidates. Maximal degree in co-relation 45587. Up to 6137 conditions per place. [2024-05-12 12:03:27,914 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 222 selfloop transitions, 72 changer transitions 0/304 dead transitions. [2024-05-12 12:03:27,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 304 transitions, 3782 flow [2024-05-12 12:03:27,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:03:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:03:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-05-12 12:03:27,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-05-12 12:03:27,915 INFO L175 Difference]: Start difference. First operand has 189 places, 264 transitions, 2914 flow. Second operand 8 states and 196 transitions. [2024-05-12 12:03:27,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 304 transitions, 3782 flow [2024-05-12 12:03:28,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 304 transitions, 3666 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-05-12 12:03:28,178 INFO L231 Difference]: Finished difference. Result has 191 places, 267 transitions, 2996 flow [2024-05-12 12:03:28,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2798, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2996, PETRI_PLACES=191, PETRI_TRANSITIONS=267} [2024-05-12 12:03:28,179 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 138 predicate places. [2024-05-12 12:03:28,179 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 267 transitions, 2996 flow [2024-05-12 12:03:28,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:28,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:28,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:28,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:03:28,180 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:28,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2145102988, now seen corresponding path program 6 times [2024-05-12 12:03:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:28,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821655499] [2024-05-12 12:03:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:38,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:38,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821655499] [2024-05-12 12:03:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821655499] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:38,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:38,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:03:38,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887890247] [2024-05-12 12:03:38,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:38,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:03:38,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:38,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:03:38,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:03:38,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:03:38,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 267 transitions, 2996 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:38,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:38,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:03:38,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:40,318 INFO L124 PetriNetUnfolderBase]: 4693/8109 cut-off events. [2024-05-12 12:03:40,318 INFO L125 PetriNetUnfolderBase]: For 158884/158897 co-relation queries the response was YES. [2024-05-12 12:03:40,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45666 conditions, 8109 events. 4693/8109 cut-off events. For 158884/158897 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 56918 event pairs, 1273 based on Foata normal form. 11/7858 useless extension candidates. Maximal degree in co-relation 45578. Up to 6124 conditions per place. [2024-05-12 12:03:40,404 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 219 selfloop transitions, 66 changer transitions 0/295 dead transitions. [2024-05-12 12:03:40,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 295 transitions, 3698 flow [2024-05-12 12:03:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:03:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:03:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-05-12 12:03:40,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5167173252279635 [2024-05-12 12:03:40,406 INFO L175 Difference]: Start difference. First operand has 191 places, 267 transitions, 2996 flow. Second operand 7 states and 170 transitions. [2024-05-12 12:03:40,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 295 transitions, 3698 flow [2024-05-12 12:03:40,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 295 transitions, 3470 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-05-12 12:03:40,640 INFO L231 Difference]: Finished difference. Result has 191 places, 267 transitions, 2908 flow [2024-05-12 12:03:40,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2768, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2908, PETRI_PLACES=191, PETRI_TRANSITIONS=267} [2024-05-12 12:03:40,641 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 138 predicate places. [2024-05-12 12:03:40,641 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 267 transitions, 2908 flow [2024-05-12 12:03:40,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:40,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:40,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:40,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:03:40,642 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:40,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2130809260, now seen corresponding path program 2 times [2024-05-12 12:03:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:40,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186600066] [2024-05-12 12:03:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:52,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:52,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186600066] [2024-05-12 12:03:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186600066] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:52,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855576547] [2024-05-12 12:03:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:52,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:52,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:03:52,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 267 transitions, 2908 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:52,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:52,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:03:52,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:54,525 INFO L124 PetriNetUnfolderBase]: 4710/8172 cut-off events. [2024-05-12 12:03:54,526 INFO L125 PetriNetUnfolderBase]: For 160228/160232 co-relation queries the response was YES. [2024-05-12 12:03:54,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45466 conditions, 8172 events. 4710/8172 cut-off events. For 160228/160232 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 57613 event pairs, 1402 based on Foata normal form. 2/7904 useless extension candidates. Maximal degree in co-relation 45379. Up to 6749 conditions per place. [2024-05-12 12:03:54,616 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 272 selfloop transitions, 21 changer transitions 0/303 dead transitions. [2024-05-12 12:03:54,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 303 transitions, 3714 flow [2024-05-12 12:03:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:03:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:03:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-05-12 12:03:54,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728132387706856 [2024-05-12 12:03:54,620 INFO L175 Difference]: Start difference. First operand has 191 places, 267 transitions, 2908 flow. Second operand 9 states and 200 transitions. [2024-05-12 12:03:54,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 303 transitions, 3714 flow [2024-05-12 12:03:54,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 303 transitions, 3572 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 12:03:54,905 INFO L231 Difference]: Finished difference. Result has 194 places, 270 transitions, 2897 flow [2024-05-12 12:03:54,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2897, PETRI_PLACES=194, PETRI_TRANSITIONS=270} [2024-05-12 12:03:54,906 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 141 predicate places. [2024-05-12 12:03:54,906 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 270 transitions, 2897 flow [2024-05-12 12:03:54,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:54,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:54,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:54,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:03:54,907 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:54,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:54,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2131284924, now seen corresponding path program 4 times [2024-05-12 12:03:54,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:54,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070812693] [2024-05-12 12:03:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:05,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:05,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070812693] [2024-05-12 12:04:05,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070812693] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:05,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:05,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:04:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043144822] [2024-05-12 12:04:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:05,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:04:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:05,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:04:05,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:04:05,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:04:05,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 270 transitions, 2897 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:05,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:05,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:04:05,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:07,865 INFO L124 PetriNetUnfolderBase]: 4845/8384 cut-off events. [2024-05-12 12:04:07,866 INFO L125 PetriNetUnfolderBase]: For 175106/175119 co-relation queries the response was YES. [2024-05-12 12:04:07,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47308 conditions, 8384 events. 4845/8384 cut-off events. For 175106/175119 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 59335 event pairs, 1379 based on Foata normal form. 10/8121 useless extension candidates. Maximal degree in co-relation 47220. Up to 6727 conditions per place. [2024-05-12 12:04:07,953 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 266 selfloop transitions, 35 changer transitions 0/311 dead transitions. [2024-05-12 12:04:07,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 311 transitions, 3909 flow [2024-05-12 12:04:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:04:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:04:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-05-12 12:04:07,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053191489361702 [2024-05-12 12:04:07,972 INFO L175 Difference]: Start difference. First operand has 194 places, 270 transitions, 2897 flow. Second operand 8 states and 190 transitions. [2024-05-12 12:04:07,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 311 transitions, 3909 flow [2024-05-12 12:04:08,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 311 transitions, 3802 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:08,205 INFO L231 Difference]: Finished difference. Result has 196 places, 278 transitions, 3064 flow [2024-05-12 12:04:08,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2790, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3064, PETRI_PLACES=196, PETRI_TRANSITIONS=278} [2024-05-12 12:04:08,205 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 143 predicate places. [2024-05-12 12:04:08,206 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 278 transitions, 3064 flow [2024-05-12 12:04:08,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:08,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:08,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:08,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:04:08,210 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:08,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2145094060, now seen corresponding path program 3 times [2024-05-12 12:04:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:08,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008654418] [2024-05-12 12:04:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:08,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:19,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008654418] [2024-05-12 12:04:19,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008654418] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:19,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301322018] [2024-05-12 12:04:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:19,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:19,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:19,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:19,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:04:19,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 278 transitions, 3064 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:19,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:19,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:04:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:22,355 INFO L124 PetriNetUnfolderBase]: 4847/8395 cut-off events. [2024-05-12 12:04:22,355 INFO L125 PetriNetUnfolderBase]: For 187054/187068 co-relation queries the response was YES. [2024-05-12 12:04:22,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48546 conditions, 8395 events. 4847/8395 cut-off events. For 187054/187068 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 59393 event pairs, 1288 based on Foata normal form. 15/8132 useless extension candidates. Maximal degree in co-relation 48456. Up to 6880 conditions per place. [2024-05-12 12:04:22,454 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 276 selfloop transitions, 34 changer transitions 0/320 dead transitions. [2024-05-12 12:04:22,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 320 transitions, 3935 flow [2024-05-12 12:04:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2024-05-12 12:04:22,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491725768321513 [2024-05-12 12:04:22,456 INFO L175 Difference]: Start difference. First operand has 196 places, 278 transitions, 3064 flow. Second operand 9 states and 208 transitions. [2024-05-12 12:04:22,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 320 transitions, 3935 flow [2024-05-12 12:04:22,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 320 transitions, 3701 flow, removed 61 selfloop flow, removed 5 redundant places. [2024-05-12 12:04:22,741 INFO L231 Difference]: Finished difference. Result has 200 places, 281 transitions, 2996 flow [2024-05-12 12:04:22,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2830, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2996, PETRI_PLACES=200, PETRI_TRANSITIONS=281} [2024-05-12 12:04:22,743 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 147 predicate places. [2024-05-12 12:04:22,743 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 281 transitions, 2996 flow [2024-05-12 12:04:22,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:22,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:22,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:22,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:04:22,744 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:22,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2145094494, now seen corresponding path program 5 times [2024-05-12 12:04:22,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:22,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956662610] [2024-05-12 12:04:22,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:22,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956662610] [2024-05-12 12:04:33,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956662610] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:33,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:33,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794895992] [2024-05-12 12:04:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:33,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:33,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:33,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:33,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:04:33,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 281 transitions, 2996 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:33,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:33,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:04:33,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:35,716 INFO L124 PetriNetUnfolderBase]: 4957/8513 cut-off events. [2024-05-12 12:04:35,716 INFO L125 PetriNetUnfolderBase]: For 201854/201867 co-relation queries the response was YES. [2024-05-12 12:04:35,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49449 conditions, 8513 events. 4957/8513 cut-off events. For 201854/201867 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 59921 event pairs, 1271 based on Foata normal form. 10/8264 useless extension candidates. Maximal degree in co-relation 49359. Up to 5848 conditions per place. [2024-05-12 12:04:35,793 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 231 selfloop transitions, 94 changer transitions 0/335 dead transitions. [2024-05-12 12:04:35,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 335 transitions, 4334 flow [2024-05-12 12:04:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-05-12 12:04:35,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-05-12 12:04:35,795 INFO L175 Difference]: Start difference. First operand has 200 places, 281 transitions, 2996 flow. Second operand 9 states and 225 transitions. [2024-05-12 12:04:35,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 335 transitions, 4334 flow [2024-05-12 12:04:36,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 335 transitions, 4190 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:36,049 INFO L231 Difference]: Finished difference. Result has 203 places, 289 transitions, 3266 flow [2024-05-12 12:04:36,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2852, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3266, PETRI_PLACES=203, PETRI_TRANSITIONS=289} [2024-05-12 12:04:36,050 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 150 predicate places. [2024-05-12 12:04:36,050 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 289 transitions, 3266 flow [2024-05-12 12:04:36,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:36,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:36,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:36,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:04:36,050 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:36,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2145106584, now seen corresponding path program 6 times [2024-05-12 12:04:36,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:36,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419415261] [2024-05-12 12:04:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:46,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419415261] [2024-05-12 12:04:46,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419415261] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:46,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:46,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:46,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344722129] [2024-05-12 12:04:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:46,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:46,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:46,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:46,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:04:46,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 289 transitions, 3266 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:46,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:46,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:04:46,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:49,344 INFO L124 PetriNetUnfolderBase]: 4988/8565 cut-off events. [2024-05-12 12:04:49,344 INFO L125 PetriNetUnfolderBase]: For 217984/217997 co-relation queries the response was YES. [2024-05-12 12:04:49,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51593 conditions, 8565 events. 4988/8565 cut-off events. For 217984/217997 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 60373 event pairs, 1266 based on Foata normal form. 10/8316 useless extension candidates. Maximal degree in co-relation 51501. Up to 5876 conditions per place. [2024-05-12 12:04:49,442 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 225 selfloop transitions, 102 changer transitions 0/337 dead transitions. [2024-05-12 12:04:49,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 337 transitions, 4399 flow [2024-05-12 12:04:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:04:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:04:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-05-12 12:04:49,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295508274231678 [2024-05-12 12:04:49,443 INFO L175 Difference]: Start difference. First operand has 203 places, 289 transitions, 3266 flow. Second operand 9 states and 224 transitions. [2024-05-12 12:04:49,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 337 transitions, 4399 flow [2024-05-12 12:04:49,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 337 transitions, 4069 flow, removed 81 selfloop flow, removed 7 redundant places. [2024-05-12 12:04:49,756 INFO L231 Difference]: Finished difference. Result has 205 places, 293 transitions, 3264 flow [2024-05-12 12:04:49,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3264, PETRI_PLACES=205, PETRI_TRANSITIONS=293} [2024-05-12 12:04:49,756 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 152 predicate places. [2024-05-12 12:04:49,757 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 293 transitions, 3264 flow [2024-05-12 12:04:49,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:49,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:49,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:49,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:04:49,757 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:49,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1349301804, now seen corresponding path program 1 times [2024-05-12 12:04:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448773625] [2024-05-12 12:04:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:01,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:01,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448773625] [2024-05-12 12:05:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448773625] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:01,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:01,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770428032] [2024-05-12 12:05:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:01,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:01,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:01,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:01,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:05:01,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 293 transitions, 3264 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:01,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:01,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:05:01,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:04,052 INFO L124 PetriNetUnfolderBase]: 5022/8433 cut-off events. [2024-05-12 12:05:04,052 INFO L125 PetriNetUnfolderBase]: For 211437/211441 co-relation queries the response was YES. [2024-05-12 12:05:04,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50045 conditions, 8433 events. 5022/8433 cut-off events. For 211437/211441 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 58815 event pairs, 2111 based on Foata normal form. 3/8230 useless extension candidates. Maximal degree in co-relation 49953. Up to 7149 conditions per place. [2024-05-12 12:05:04,139 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 297 selfloop transitions, 22 changer transitions 0/329 dead transitions. [2024-05-12 12:05:04,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 329 transitions, 4109 flow [2024-05-12 12:05:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:05:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:05:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-05-12 12:05:04,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-05-12 12:05:04,141 INFO L175 Difference]: Start difference. First operand has 205 places, 293 transitions, 3264 flow. Second operand 9 states and 198 transitions. [2024-05-12 12:05:04,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 329 transitions, 4109 flow [2024-05-12 12:05:04,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 329 transitions, 3862 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-05-12 12:05:04,504 INFO L231 Difference]: Finished difference. Result has 208 places, 298 transitions, 3153 flow [2024-05-12 12:05:04,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3019, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3153, PETRI_PLACES=208, PETRI_TRANSITIONS=298} [2024-05-12 12:05:04,505 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 155 predicate places. [2024-05-12 12:05:04,505 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 298 transitions, 3153 flow [2024-05-12 12:05:04,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:04,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:04,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:04,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:05:04,506 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:04,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2131099978, now seen corresponding path program 2 times [2024-05-12 12:05:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:04,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753477035] [2024-05-12 12:05:04,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:16,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:16,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753477035] [2024-05-12 12:05:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753477035] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:16,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:16,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:05:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997054503] [2024-05-12 12:05:16,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:16,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:05:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:16,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:05:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:05:16,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:05:16,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 298 transitions, 3153 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:16,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:16,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:05:16,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:18,760 INFO L124 PetriNetUnfolderBase]: 5090/8832 cut-off events. [2024-05-12 12:05:18,761 INFO L125 PetriNetUnfolderBase]: For 219358/219371 co-relation queries the response was YES. [2024-05-12 12:05:18,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50820 conditions, 8832 events. 5090/8832 cut-off events. For 219358/219371 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 63480 event pairs, 2059 based on Foata normal form. 9/8552 useless extension candidates. Maximal degree in co-relation 50727. Up to 7149 conditions per place. [2024-05-12 12:05:18,855 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 292 selfloop transitions, 34 changer transitions 0/336 dead transitions. [2024-05-12 12:05:18,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 336 transitions, 4041 flow [2024-05-12 12:05:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:05:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:05:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-05-12 12:05:18,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946808510638298 [2024-05-12 12:05:18,856 INFO L175 Difference]: Start difference. First operand has 208 places, 298 transitions, 3153 flow. Second operand 8 states and 186 transitions. [2024-05-12 12:05:18,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 336 transitions, 4041 flow [2024-05-12 12:05:19,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 336 transitions, 3940 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-05-12 12:05:19,222 INFO L231 Difference]: Finished difference. Result has 210 places, 305 transitions, 3221 flow [2024-05-12 12:05:19,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3052, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3221, PETRI_PLACES=210, PETRI_TRANSITIONS=305} [2024-05-12 12:05:19,222 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 157 predicate places. [2024-05-12 12:05:19,222 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 305 transitions, 3221 flow [2024-05-12 12:05:19,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:19,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:19,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:19,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 12:05:19,223 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:19,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2130803308, now seen corresponding path program 3 times [2024-05-12 12:05:19,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:19,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429679916] [2024-05-12 12:05:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:29,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:29,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429679916] [2024-05-12 12:05:29,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429679916] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:29,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:29,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:05:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646392304] [2024-05-12 12:05:29,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:29,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:05:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:05:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:05:30,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:05:30,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 305 transitions, 3221 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:30,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:30,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:05:30,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:32,391 INFO L124 PetriNetUnfolderBase]: 5107/8746 cut-off events. [2024-05-12 12:05:32,391 INFO L125 PetriNetUnfolderBase]: For 227535/227548 co-relation queries the response was YES. [2024-05-12 12:05:32,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51850 conditions, 8746 events. 5107/8746 cut-off events. For 227535/227548 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 61688 event pairs, 2017 based on Foata normal form. 8/8508 useless extension candidates. Maximal degree in co-relation 51756. Up to 7176 conditions per place. [2024-05-12 12:05:32,483 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 296 selfloop transitions, 55 changer transitions 0/361 dead transitions. [2024-05-12 12:05:32,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 361 transitions, 4494 flow [2024-05-12 12:05:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:05:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:05:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-05-12 12:05:32,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4920212765957447 [2024-05-12 12:05:32,485 INFO L175 Difference]: Start difference. First operand has 210 places, 305 transitions, 3221 flow. Second operand 8 states and 185 transitions. [2024-05-12 12:05:32,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 361 transitions, 4494 flow [2024-05-12 12:05:32,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 361 transitions, 4324 flow, removed 44 selfloop flow, removed 5 redundant places. [2024-05-12 12:05:32,829 INFO L231 Difference]: Finished difference. Result has 216 places, 331 transitions, 3615 flow [2024-05-12 12:05:32,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3104, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3615, PETRI_PLACES=216, PETRI_TRANSITIONS=331} [2024-05-12 12:05:32,830 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 163 predicate places. [2024-05-12 12:05:32,830 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 331 transitions, 3615 flow [2024-05-12 12:05:32,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:32,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:32,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:32,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 12:05:32,831 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:32,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2139374188, now seen corresponding path program 4 times [2024-05-12 12:05:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:32,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063513955] [2024-05-12 12:05:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:44,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:44,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063513955] [2024-05-12 12:05:44,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063513955] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:44,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:05:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151638015] [2024-05-12 12:05:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:44,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:05:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:44,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:05:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:05:44,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:05:44,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 331 transitions, 3615 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:44,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:44,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:05:44,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:47,045 INFO L124 PetriNetUnfolderBase]: 5126/8891 cut-off events. [2024-05-12 12:05:47,046 INFO L125 PetriNetUnfolderBase]: For 239212/239225 co-relation queries the response was YES. [2024-05-12 12:05:47,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53293 conditions, 8891 events. 5126/8891 cut-off events. For 239212/239225 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 63979 event pairs, 2062 based on Foata normal form. 9/8612 useless extension candidates. Maximal degree in co-relation 53195. Up to 7198 conditions per place. [2024-05-12 12:05:47,147 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 316 selfloop transitions, 44 changer transitions 0/370 dead transitions. [2024-05-12 12:05:47,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 370 transitions, 4657 flow [2024-05-12 12:05:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:05:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:05:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-05-12 12:05:47,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973404255319149 [2024-05-12 12:05:47,148 INFO L175 Difference]: Start difference. First operand has 216 places, 331 transitions, 3615 flow. Second operand 8 states and 187 transitions. [2024-05-12 12:05:47,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 370 transitions, 4657 flow [2024-05-12 12:05:47,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 370 transitions, 4445 flow, removed 99 selfloop flow, removed 2 redundant places. [2024-05-12 12:05:47,612 INFO L231 Difference]: Finished difference. Result has 222 places, 337 transitions, 3680 flow [2024-05-12 12:05:47,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3469, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3680, PETRI_PLACES=222, PETRI_TRANSITIONS=337} [2024-05-12 12:05:47,613 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 169 predicate places. [2024-05-12 12:05:47,613 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 337 transitions, 3680 flow [2024-05-12 12:05:47,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:47,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:05:47,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:05:47,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 12:05:47,614 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:05:47,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:05:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1789266210, now seen corresponding path program 1 times [2024-05-12 12:05:47,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:05:47,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983240458] [2024-05-12 12:05:47,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:05:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:05:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:05:58,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:58,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983240458] [2024-05-12 12:05:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983240458] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:58,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:58,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:58,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527983715] [2024-05-12 12:05:58,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:58,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:58,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:58,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:58,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:58,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:05:58,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 337 transitions, 3680 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:58,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:58,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:05:58,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:01,267 INFO L124 PetriNetUnfolderBase]: 5340/8849 cut-off events. [2024-05-12 12:06:01,268 INFO L125 PetriNetUnfolderBase]: For 250531/250554 co-relation queries the response was YES. [2024-05-12 12:06:01,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54888 conditions, 8849 events. 5340/8849 cut-off events. For 250531/250554 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 60889 event pairs, 1471 based on Foata normal form. 30/8677 useless extension candidates. Maximal degree in co-relation 54788. Up to 7295 conditions per place. [2024-05-12 12:06:01,362 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 337 selfloop transitions, 54 changer transitions 0/401 dead transitions. [2024-05-12 12:06:01,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 401 transitions, 4849 flow [2024-05-12 12:06:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-05-12 12:06:01,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-05-12 12:06:01,364 INFO L175 Difference]: Start difference. First operand has 222 places, 337 transitions, 3680 flow. Second operand 9 states and 225 transitions. [2024-05-12 12:06:01,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 401 transitions, 4849 flow [2024-05-12 12:06:01,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 401 transitions, 4681 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-05-12 12:06:01,822 INFO L231 Difference]: Finished difference. Result has 227 places, 353 transitions, 3869 flow [2024-05-12 12:06:01,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3512, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3869, PETRI_PLACES=227, PETRI_TRANSITIONS=353} [2024-05-12 12:06:01,822 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 174 predicate places. [2024-05-12 12:06:01,822 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 353 transitions, 3869 flow [2024-05-12 12:06:01,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:01,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:01,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:01,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 12:06:01,823 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:01,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1162902538, now seen corresponding path program 2 times [2024-05-12 12:06:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:01,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35048168] [2024-05-12 12:06:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35048168] [2024-05-12 12:06:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35048168] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:06:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219978917] [2024-05-12 12:06:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:12,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:06:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:12,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:06:12,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:06:12,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:06:12,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 353 transitions, 3869 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:12,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:12,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:06:12,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:14,880 INFO L124 PetriNetUnfolderBase]: 5729/9524 cut-off events. [2024-05-12 12:06:14,881 INFO L125 PetriNetUnfolderBase]: For 275163/275178 co-relation queries the response was YES. [2024-05-12 12:06:14,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60480 conditions, 9524 events. 5729/9524 cut-off events. For 275163/275178 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 66069 event pairs, 1637 based on Foata normal form. 22/9317 useless extension candidates. Maximal degree in co-relation 60377. Up to 7675 conditions per place. [2024-05-12 12:06:14,998 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 345 selfloop transitions, 71 changer transitions 0/426 dead transitions. [2024-05-12 12:06:14,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 426 transitions, 5350 flow [2024-05-12 12:06:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-05-12 12:06:15,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295508274231678 [2024-05-12 12:06:15,000 INFO L175 Difference]: Start difference. First operand has 227 places, 353 transitions, 3869 flow. Second operand 9 states and 224 transitions. [2024-05-12 12:06:15,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 426 transitions, 5350 flow [2024-05-12 12:06:15,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 426 transitions, 5074 flow, removed 76 selfloop flow, removed 5 redundant places. [2024-05-12 12:06:15,513 INFO L231 Difference]: Finished difference. Result has 235 places, 382 transitions, 4312 flow [2024-05-12 12:06:15,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3703, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4312, PETRI_PLACES=235, PETRI_TRANSITIONS=382} [2024-05-12 12:06:15,514 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 182 predicate places. [2024-05-12 12:06:15,514 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 382 transitions, 4312 flow [2024-05-12 12:06:15,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:15,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:15,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:15,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 12:06:15,515 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:15,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1249627910, now seen corresponding path program 3 times [2024-05-12 12:06:15,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:15,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246377964] [2024-05-12 12:06:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:15,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:26,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-05-12 12:06:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:26,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246377964] [2024-05-12 12:06:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246377964] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:26,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:06:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327272775] [2024-05-12 12:06:26,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:26,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:06:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:26,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:06:26,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:06:26,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:06:26,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 382 transitions, 4312 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:26,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:26,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:06:26,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:29,225 INFO L124 PetriNetUnfolderBase]: 5936/9889 cut-off events. [2024-05-12 12:06:29,225 INFO L125 PetriNetUnfolderBase]: For 291293/291308 co-relation queries the response was YES. [2024-05-12 12:06:29,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63449 conditions, 9889 events. 5936/9889 cut-off events. For 291293/291308 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 69424 event pairs, 1780 based on Foata normal form. 24/9682 useless extension candidates. Maximal degree in co-relation 63341. Up to 8123 conditions per place. [2024-05-12 12:06:29,344 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 354 selfloop transitions, 69 changer transitions 0/433 dead transitions. [2024-05-12 12:06:29,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 433 transitions, 5493 flow [2024-05-12 12:06:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-05-12 12:06:29,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295508274231678 [2024-05-12 12:06:29,349 INFO L175 Difference]: Start difference. First operand has 235 places, 382 transitions, 4312 flow. Second operand 9 states and 224 transitions. [2024-05-12 12:06:29,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 433 transitions, 5493 flow [2024-05-12 12:06:29,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 433 transitions, 5355 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-05-12 12:06:29,973 INFO L231 Difference]: Finished difference. Result has 242 places, 388 transitions, 4437 flow [2024-05-12 12:06:29,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4174, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4437, PETRI_PLACES=242, PETRI_TRANSITIONS=388} [2024-05-12 12:06:29,974 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 189 predicate places. [2024-05-12 12:06:29,974 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 388 transitions, 4437 flow [2024-05-12 12:06:29,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:29,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:29,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:29,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 12:06:29,975 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:29,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1257706910, now seen corresponding path program 4 times [2024-05-12 12:06:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:29,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656978343] [2024-05-12 12:06:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:39,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:39,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656978343] [2024-05-12 12:06:39,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656978343] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:39,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:39,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:06:39,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269762370] [2024-05-12 12:06:39,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:39,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:06:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:39,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:06:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:06:40,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:06:40,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 388 transitions, 4437 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:40,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:40,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:06:40,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:43,224 INFO L124 PetriNetUnfolderBase]: 6518/10950 cut-off events. [2024-05-12 12:06:43,224 INFO L125 PetriNetUnfolderBase]: For 308573/308588 co-relation queries the response was YES. [2024-05-12 12:06:43,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68631 conditions, 10950 events. 6518/10950 cut-off events. For 308573/308588 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 78421 event pairs, 1524 based on Foata normal form. 22/10697 useless extension candidates. Maximal degree in co-relation 68521. Up to 8454 conditions per place. [2024-05-12 12:06:43,349 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 353 selfloop transitions, 101 changer transitions 0/464 dead transitions. [2024-05-12 12:06:43,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 464 transitions, 5903 flow [2024-05-12 12:06:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:06:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:06:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-05-12 12:06:43,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295508274231678 [2024-05-12 12:06:43,351 INFO L175 Difference]: Start difference. First operand has 242 places, 388 transitions, 4437 flow. Second operand 9 states and 224 transitions. [2024-05-12 12:06:43,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 464 transitions, 5903 flow [2024-05-12 12:06:43,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 464 transitions, 5719 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-05-12 12:06:43,925 INFO L231 Difference]: Finished difference. Result has 247 places, 418 transitions, 4902 flow [2024-05-12 12:06:43,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4253, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4902, PETRI_PLACES=247, PETRI_TRANSITIONS=418} [2024-05-12 12:06:43,926 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 194 predicate places. [2024-05-12 12:06:43,926 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 418 transitions, 4902 flow [2024-05-12 12:06:43,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:43,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:43,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:43,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 12:06:43,926 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:43,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1352436796, now seen corresponding path program 1 times [2024-05-12 12:06:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:43,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827132448] [2024-05-12 12:06:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:06:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:06:54,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:06:54,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827132448] [2024-05-12 12:06:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827132448] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:06:54,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:06:54,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:06:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966514640] [2024-05-12 12:06:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:06:54,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:06:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:06:54,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:06:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:06:54,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:06:54,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 418 transitions, 4902 flow. Second operand has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:54,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:06:54,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:06:54,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:06:57,932 INFO L124 PetriNetUnfolderBase]: 6616/11177 cut-off events. [2024-05-12 12:06:57,933 INFO L125 PetriNetUnfolderBase]: For 325963/325978 co-relation queries the response was YES. [2024-05-12 12:06:58,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73066 conditions, 11177 events. 6616/11177 cut-off events. For 325963/325978 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 80879 event pairs, 2029 based on Foata normal form. 14/10896 useless extension candidates. Maximal degree in co-relation 72953. Up to 9162 conditions per place. [2024-05-12 12:06:58,065 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 380 selfloop transitions, 101 changer transitions 0/491 dead transitions. [2024-05-12 12:06:58,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 491 transitions, 6569 flow [2024-05-12 12:06:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:06:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:06:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-05-12 12:06:58,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234042553191489 [2024-05-12 12:06:58,067 INFO L175 Difference]: Start difference. First operand has 247 places, 418 transitions, 4902 flow. Second operand 10 states and 246 transitions. [2024-05-12 12:06:58,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 491 transitions, 6569 flow [2024-05-12 12:06:58,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 491 transitions, 6371 flow, removed 60 selfloop flow, removed 5 redundant places. [2024-05-12 12:06:58,729 INFO L231 Difference]: Finished difference. Result has 255 places, 443 transitions, 5474 flow [2024-05-12 12:06:58,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4704, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5474, PETRI_PLACES=255, PETRI_TRANSITIONS=443} [2024-05-12 12:06:58,730 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 202 predicate places. [2024-05-12 12:06:58,730 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 443 transitions, 5474 flow [2024-05-12 12:06:58,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:06:58,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:06:58,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:06:58,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 12:06:58,730 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:06:58,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:06:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1154301898, now seen corresponding path program 5 times [2024-05-12 12:06:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:06:58,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642016567] [2024-05-12 12:06:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:06:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:06:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:09,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:09,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642016567] [2024-05-12 12:07:09,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642016567] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:09,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:09,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:07:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544947580] [2024-05-12 12:07:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:09,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:07:09,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:09,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:07:09,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:07:09,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:07:09,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 443 transitions, 5474 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:09,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:09,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:07:09,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:12,968 INFO L124 PetriNetUnfolderBase]: 7030/11769 cut-off events. [2024-05-12 12:07:12,968 INFO L125 PetriNetUnfolderBase]: For 362574/362589 co-relation queries the response was YES. [2024-05-12 12:07:13,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78689 conditions, 11769 events. 7030/11769 cut-off events. For 362574/362589 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 84742 event pairs, 2076 based on Foata normal form. 24/11501 useless extension candidates. Maximal degree in co-relation 78572. Up to 9516 conditions per place. [2024-05-12 12:07:13,124 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 418 selfloop transitions, 73 changer transitions 0/501 dead transitions. [2024-05-12 12:07:13,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 501 transitions, 6963 flow [2024-05-12 12:07:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:07:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:07:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-05-12 12:07:13,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271867612293144 [2024-05-12 12:07:13,125 INFO L175 Difference]: Start difference. First operand has 255 places, 443 transitions, 5474 flow. Second operand 9 states and 223 transitions. [2024-05-12 12:07:13,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 501 transitions, 6963 flow [2024-05-12 12:07:14,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 501 transitions, 6624 flow, removed 139 selfloop flow, removed 3 redundant places. [2024-05-12 12:07:14,027 INFO L231 Difference]: Finished difference. Result has 262 places, 457 transitions, 5566 flow [2024-05-12 12:07:14,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5149, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5566, PETRI_PLACES=262, PETRI_TRANSITIONS=457} [2024-05-12 12:07:14,028 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 209 predicate places. [2024-05-12 12:07:14,028 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 457 transitions, 5566 flow [2024-05-12 12:07:14,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:14,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:14,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:14,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 12:07:14,028 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:07:14,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:14,029 INFO L85 PathProgramCache]: Analyzing trace with hash -866520838, now seen corresponding path program 6 times [2024-05-12 12:07:14,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:14,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413180190] [2024-05-12 12:07:14,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:24,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:24,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413180190] [2024-05-12 12:07:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413180190] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:24,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:07:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041402382] [2024-05-12 12:07:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:24,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:07:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:07:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:07:24,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:07:24,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 457 transitions, 5566 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:24,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:24,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:07:24,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:28,361 INFO L124 PetriNetUnfolderBase]: 7424/12523 cut-off events. [2024-05-12 12:07:28,361 INFO L125 PetriNetUnfolderBase]: For 381645/381654 co-relation queries the response was YES. [2024-05-12 12:07:28,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83007 conditions, 12523 events. 7424/12523 cut-off events. For 381645/381654 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 91931 event pairs, 2105 based on Foata normal form. 18/12206 useless extension candidates. Maximal degree in co-relation 82888. Up to 10003 conditions per place. [2024-05-12 12:07:28,546 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 426 selfloop transitions, 85 changer transitions 0/521 dead transitions. [2024-05-12 12:07:28,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 521 transitions, 7128 flow [2024-05-12 12:07:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:07:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:07:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-05-12 12:07:28,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-05-12 12:07:28,547 INFO L175 Difference]: Start difference. First operand has 262 places, 457 transitions, 5566 flow. Second operand 9 states and 222 transitions. [2024-05-12 12:07:28,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 521 transitions, 7128 flow [2024-05-12 12:07:29,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 521 transitions, 6941 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-05-12 12:07:29,845 INFO L231 Difference]: Finished difference. Result has 267 places, 476 transitions, 5859 flow [2024-05-12 12:07:29,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5379, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5859, PETRI_PLACES=267, PETRI_TRANSITIONS=476} [2024-05-12 12:07:29,846 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 214 predicate places. [2024-05-12 12:07:29,846 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 476 transitions, 5859 flow [2024-05-12 12:07:29,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:29,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:29,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:29,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 12:07:29,846 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:07:29,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1420526734, now seen corresponding path program 1 times [2024-05-12 12:07:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891171918] [2024-05-12 12:07:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891171918] [2024-05-12 12:07:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891171918] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:41,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:41,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:07:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548615293] [2024-05-12 12:07:41,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:41,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:07:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:07:41,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:07:41,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:07:41,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 476 transitions, 5859 flow. Second operand has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:41,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:41,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:07:41,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:07:45,830 INFO L124 PetriNetUnfolderBase]: 7514/12651 cut-off events. [2024-05-12 12:07:45,831 INFO L125 PetriNetUnfolderBase]: For 374654/374663 co-relation queries the response was YES. [2024-05-12 12:07:45,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84482 conditions, 12651 events. 7514/12651 cut-off events. For 374654/374663 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 92673 event pairs, 2235 based on Foata normal form. 8/12320 useless extension candidates. Maximal degree in co-relation 84360. Up to 10471 conditions per place. [2024-05-12 12:07:45,984 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 453 selfloop transitions, 73 changer transitions 0/536 dead transitions. [2024-05-12 12:07:45,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 536 transitions, 7419 flow [2024-05-12 12:07:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:07:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:07:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2024-05-12 12:07:45,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224586288416075 [2024-05-12 12:07:45,985 INFO L175 Difference]: Start difference. First operand has 267 places, 476 transitions, 5859 flow. Second operand 9 states and 221 transitions. [2024-05-12 12:07:45,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 536 transitions, 7419 flow [2024-05-12 12:07:46,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 536 transitions, 7221 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-05-12 12:07:46,860 INFO L231 Difference]: Finished difference. Result has 274 places, 496 transitions, 6230 flow [2024-05-12 12:07:46,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=5665, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6230, PETRI_PLACES=274, PETRI_TRANSITIONS=496} [2024-05-12 12:07:46,861 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 221 predicate places. [2024-05-12 12:07:46,861 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 496 transitions, 6230 flow [2024-05-12 12:07:46,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:46,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:07:46,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:07:46,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 12:07:46,862 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:07:46,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:07:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1044451569, now seen corresponding path program 1 times [2024-05-12 12:07:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:07:46,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327014297] [2024-05-12 12:07:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:07:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:07:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:07:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:07:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:07:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327014297] [2024-05-12 12:07:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327014297] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:07:57,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:07:57,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:07:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182568598] [2024-05-12 12:07:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:07:57,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:07:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:07:57,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:07:57,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:07:57,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:07:57,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 496 transitions, 6230 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:07:57,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:07:57,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:07:57,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:01,701 INFO L124 PetriNetUnfolderBase]: 7650/12874 cut-off events. [2024-05-12 12:08:01,701 INFO L125 PetriNetUnfolderBase]: For 396305/396314 co-relation queries the response was YES. [2024-05-12 12:08:01,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87291 conditions, 12874 events. 7650/12874 cut-off events. For 396305/396314 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 94560 event pairs, 2207 based on Foata normal form. 10/12538 useless extension candidates. Maximal degree in co-relation 87165. Up to 10670 conditions per place. [2024-05-12 12:08:01,879 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 465 selfloop transitions, 68 changer transitions 0/543 dead transitions. [2024-05-12 12:08:01,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 543 transitions, 7637 flow [2024-05-12 12:08:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:08:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:08:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-05-12 12:08:01,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200945626477541 [2024-05-12 12:08:01,881 INFO L175 Difference]: Start difference. First operand has 274 places, 496 transitions, 6230 flow. Second operand 9 states and 220 transitions. [2024-05-12 12:08:01,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 543 transitions, 7637 flow [2024-05-12 12:08:02,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 543 transitions, 7428 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-05-12 12:08:02,846 INFO L231 Difference]: Finished difference. Result has 280 places, 504 transitions, 6298 flow [2024-05-12 12:08:02,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6021, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6298, PETRI_PLACES=280, PETRI_TRANSITIONS=504} [2024-05-12 12:08:02,863 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 227 predicate places. [2024-05-12 12:08:02,863 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 504 transitions, 6298 flow [2024-05-12 12:08:02,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:02,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:02,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:02,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 12:08:02,864 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:08:02,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1689181353, now seen corresponding path program 2 times [2024-05-12 12:08:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:02,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625807042] [2024-05-12 12:08:02,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:02,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625807042] [2024-05-12 12:08:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625807042] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:08:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077574503] [2024-05-12 12:08:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:13,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:08:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:08:13,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:08:13,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:08:13,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 504 transitions, 6298 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:13,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:13,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:08:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:17,644 INFO L124 PetriNetUnfolderBase]: 8052/13541 cut-off events. [2024-05-12 12:08:17,644 INFO L125 PetriNetUnfolderBase]: For 430467/430476 co-relation queries the response was YES. [2024-05-12 12:08:17,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92216 conditions, 13541 events. 8052/13541 cut-off events. For 430467/430476 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 100099 event pairs, 2227 based on Foata normal form. 10/13186 useless extension candidates. Maximal degree in co-relation 92088. Up to 10502 conditions per place. [2024-05-12 12:08:17,834 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 455 selfloop transitions, 110 changer transitions 0/575 dead transitions. [2024-05-12 12:08:17,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 575 transitions, 8303 flow [2024-05-12 12:08:17,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:08:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:08:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-05-12 12:08:17,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295508274231678 [2024-05-12 12:08:17,836 INFO L175 Difference]: Start difference. First operand has 280 places, 504 transitions, 6298 flow. Second operand 9 states and 224 transitions. [2024-05-12 12:08:17,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 575 transitions, 8303 flow [2024-05-12 12:08:18,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 575 transitions, 8161 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-05-12 12:08:18,744 INFO L231 Difference]: Finished difference. Result has 286 places, 530 transitions, 6809 flow [2024-05-12 12:08:18,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6156, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6809, PETRI_PLACES=286, PETRI_TRANSITIONS=530} [2024-05-12 12:08:18,745 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 233 predicate places. [2024-05-12 12:08:18,745 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 530 transitions, 6809 flow [2024-05-12 12:08:18,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:18,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:18,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:18,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 12:08:18,746 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:08:18,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash -866130579, now seen corresponding path program 3 times [2024-05-12 12:08:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738691452] [2024-05-12 12:08:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:29,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:29,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738691452] [2024-05-12 12:08:29,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738691452] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:29,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:29,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:08:29,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154746626] [2024-05-12 12:08:29,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:29,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:08:29,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:29,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:08:29,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:08:29,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:08:29,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 530 transitions, 6809 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:29,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:29,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:08:29,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:33,303 INFO L124 PetriNetUnfolderBase]: 8040/13524 cut-off events. [2024-05-12 12:08:33,303 INFO L125 PetriNetUnfolderBase]: For 435934/435943 co-relation queries the response was YES. [2024-05-12 12:08:33,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93062 conditions, 13524 events. 8040/13524 cut-off events. For 435934/435943 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 100032 event pairs, 2152 based on Foata normal form. 10/13161 useless extension candidates. Maximal degree in co-relation 92932. Up to 10494 conditions per place. [2024-05-12 12:08:33,503 INFO L140 encePairwiseOnDemand]: 31/47 looper letters, 451 selfloop transitions, 113 changer transitions 0/574 dead transitions. [2024-05-12 12:08:33,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 574 transitions, 8387 flow [2024-05-12 12:08:33,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:08:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:08:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-05-12 12:08:33,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-05-12 12:08:33,505 INFO L175 Difference]: Start difference. First operand has 286 places, 530 transitions, 6809 flow. Second operand 9 states and 222 transitions. [2024-05-12 12:08:33,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 574 transitions, 8387 flow [2024-05-12 12:08:34,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 574 transitions, 8214 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-05-12 12:08:34,703 INFO L231 Difference]: Finished difference. Result has 291 places, 530 transitions, 6873 flow [2024-05-12 12:08:34,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6636, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6873, PETRI_PLACES=291, PETRI_TRANSITIONS=530} [2024-05-12 12:08:34,704 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 238 predicate places. [2024-05-12 12:08:34,704 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 530 transitions, 6873 flow [2024-05-12 12:08:34,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:34,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:34,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:34,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 12:08:34,705 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:08:34,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1499042930, now seen corresponding path program 2 times [2024-05-12 12:08:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285621091] [2024-05-12 12:08:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:08:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:08:46,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:08:46,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285621091] [2024-05-12 12:08:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285621091] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:08:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:08:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:08:46,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901900506] [2024-05-12 12:08:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:08:46,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:08:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:08:46,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:08:46,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:08:46,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:08:46,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 530 transitions, 6873 flow. Second operand has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:46,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:08:46,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:08:46,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:08:50,561 INFO L124 PetriNetUnfolderBase]: 8176/13689 cut-off events. [2024-05-12 12:08:50,561 INFO L125 PetriNetUnfolderBase]: For 443818/443833 co-relation queries the response was YES. [2024-05-12 12:08:50,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94943 conditions, 13689 events. 8176/13689 cut-off events. For 443818/443833 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 100810 event pairs, 2343 based on Foata normal form. 15/13343 useless extension candidates. Maximal degree in co-relation 94811. Up to 11292 conditions per place. [2024-05-12 12:08:50,773 INFO L140 encePairwiseOnDemand]: 30/47 looper letters, 494 selfloop transitions, 87 changer transitions 0/591 dead transitions. [2024-05-12 12:08:50,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 591 transitions, 8597 flow [2024-05-12 12:08:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:08:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:08:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2024-05-12 12:08:50,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191489361702127 [2024-05-12 12:08:50,775 INFO L175 Difference]: Start difference. First operand has 291 places, 530 transitions, 6873 flow. Second operand 10 states and 244 transitions. [2024-05-12 12:08:50,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 591 transitions, 8597 flow [2024-05-12 12:08:51,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 591 transitions, 8413 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 12:08:51,750 INFO L231 Difference]: Finished difference. Result has 296 places, 545 transitions, 7184 flow [2024-05-12 12:08:51,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6694, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7184, PETRI_PLACES=296, PETRI_TRANSITIONS=545} [2024-05-12 12:08:51,752 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 243 predicate places. [2024-05-12 12:08:51,752 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 545 transitions, 7184 flow [2024-05-12 12:08:51,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:08:51,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:08:51,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:08:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-05-12 12:08:51,753 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:08:51,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:08:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -866508934, now seen corresponding path program 3 times [2024-05-12 12:08:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:08:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543392890] [2024-05-12 12:08:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:08:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:08:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:02,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543392890] [2024-05-12 12:09:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543392890] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:02,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:02,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:09:02,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565885407] [2024-05-12 12:09:02,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:02,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:09:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:02,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:09:02,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:09:02,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:09:02,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 545 transitions, 7184 flow. Second operand has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:02,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:02,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:09:02,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:07,085 INFO L124 PetriNetUnfolderBase]: 8280/13933 cut-off events. [2024-05-12 12:09:07,085 INFO L125 PetriNetUnfolderBase]: For 478835/478844 co-relation queries the response was YES. [2024-05-12 12:09:07,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98696 conditions, 13933 events. 8280/13933 cut-off events. For 478835/478844 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 103605 event pairs, 2154 based on Foata normal form. 8/13558 useless extension candidates. Maximal degree in co-relation 98562. Up to 11000 conditions per place. [2024-05-12 12:09:07,296 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 507 selfloop transitions, 132 changer transitions 0/649 dead transitions. [2024-05-12 12:09:07,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 649 transitions, 9998 flow [2024-05-12 12:09:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:09:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:09:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 245 transitions. [2024-05-12 12:09:07,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-05-12 12:09:07,298 INFO L175 Difference]: Start difference. First operand has 296 places, 545 transitions, 7184 flow. Second operand 10 states and 245 transitions. [2024-05-12 12:09:07,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 649 transitions, 9998 flow [2024-05-12 12:09:08,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 649 transitions, 9721 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-05-12 12:09:08,598 INFO L231 Difference]: Finished difference. Result has 302 places, 595 transitions, 8374 flow [2024-05-12 12:09:08,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=6911, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8374, PETRI_PLACES=302, PETRI_TRANSITIONS=595} [2024-05-12 12:09:08,599 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 249 predicate places. [2024-05-12 12:09:08,599 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 595 transitions, 8374 flow [2024-05-12 12:09:08,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:08,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:08,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:08,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-05-12 12:09:08,600 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:09:08,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -866134144, now seen corresponding path program 4 times [2024-05-12 12:09:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:08,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326028059] [2024-05-12 12:09:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:09:20,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:20,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326028059] [2024-05-12 12:09:20,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326028059] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:20,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:09:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682885422] [2024-05-12 12:09:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:20,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:09:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:09:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:09:21,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:09:21,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 595 transitions, 8374 flow. Second operand has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:21,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:21,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:09:21,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:25,865 INFO L124 PetriNetUnfolderBase]: 8335/13902 cut-off events. [2024-05-12 12:09:25,866 INFO L125 PetriNetUnfolderBase]: For 504253/504262 co-relation queries the response was YES. [2024-05-12 12:09:26,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101932 conditions, 13902 events. 8335/13902 cut-off events. For 504253/504262 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 102153 event pairs, 2160 based on Foata normal form. 9/13557 useless extension candidates. Maximal degree in co-relation 101794. Up to 10835 conditions per place. [2024-05-12 12:09:26,074 INFO L140 encePairwiseOnDemand]: 30/47 looper letters, 493 selfloop transitions, 147 changer transitions 0/650 dead transitions. [2024-05-12 12:09:26,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 650 transitions, 10384 flow [2024-05-12 12:09:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:09:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:09:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 245 transitions. [2024-05-12 12:09:26,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-05-12 12:09:26,075 INFO L175 Difference]: Start difference. First operand has 302 places, 595 transitions, 8374 flow. Second operand 10 states and 245 transitions. [2024-05-12 12:09:26,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 650 transitions, 10384 flow [2024-05-12 12:09:27,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 650 transitions, 9962 flow, removed 204 selfloop flow, removed 2 redundant places. [2024-05-12 12:09:27,458 INFO L231 Difference]: Finished difference. Result has 311 places, 601 transitions, 8568 flow [2024-05-12 12:09:27,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7996, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8568, PETRI_PLACES=311, PETRI_TRANSITIONS=601} [2024-05-12 12:09:27,459 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 258 predicate places. [2024-05-12 12:09:27,459 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 601 transitions, 8568 flow [2024-05-12 12:09:27,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:27,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:27,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:27,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-05-12 12:09:27,459 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:09:27,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash -866120659, now seen corresponding path program 1 times [2024-05-12 12:09:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:27,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234062222] [2024-05-12 12:09:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:09:39,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-05-12 12:09:39,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:09:39,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234062222] [2024-05-12 12:09:39,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234062222] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:09:39,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:09:39,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:09:39,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097861956] [2024-05-12 12:09:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:09:39,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:09:39,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:09:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:09:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:09:40,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 12:09:40,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 601 transitions, 8568 flow. Second operand has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:40,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:09:40,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 12:09:40,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:09:45,042 INFO L124 PetriNetUnfolderBase]: 8380/14141 cut-off events. [2024-05-12 12:09:45,042 INFO L125 PetriNetUnfolderBase]: For 530208/530214 co-relation queries the response was YES. [2024-05-12 12:09:45,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104847 conditions, 14141 events. 8380/14141 cut-off events. For 530208/530214 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 105979 event pairs, 2751 based on Foata normal form. 8/13765 useless extension candidates. Maximal degree in co-relation 104706. Up to 11905 conditions per place. [2024-05-12 12:09:45,258 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 611 selfloop transitions, 29 changer transitions 0/650 dead transitions. [2024-05-12 12:09:45,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 650 transitions, 10248 flow [2024-05-12 12:09:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:09:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:09:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions. [2024-05-12 12:09:45,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48723404255319147 [2024-05-12 12:09:45,260 INFO L175 Difference]: Start difference. First operand has 311 places, 601 transitions, 8568 flow. Second operand 10 states and 229 transitions. [2024-05-12 12:09:45,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 650 transitions, 10248 flow [2024-05-12 12:09:46,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 650 transitions, 9886 flow, removed 73 selfloop flow, removed 6 redundant places. [2024-05-12 12:09:46,733 INFO L231 Difference]: Finished difference. Result has 317 places, 608 transitions, 8456 flow [2024-05-12 12:09:46,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=8210, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8456, PETRI_PLACES=317, PETRI_TRANSITIONS=608} [2024-05-12 12:09:46,733 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 264 predicate places. [2024-05-12 12:09:46,734 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 608 transitions, 8456 flow [2024-05-12 12:09:46,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.7) internal successors, (147), 10 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:09:46,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:09:46,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:09:46,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-12 12:09:46,734 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:09:46,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:09:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash -866121124, now seen corresponding path program 5 times [2024-05-12 12:09:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:09:46,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383050911] [2024-05-12 12:09:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:09:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:09:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15