./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix016_pso.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/mix016_pso.opt_tso.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix016_pso.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:25:39,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:25:39,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:25:39,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:25:39,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:25:39,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:25:39,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:25:39,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:25:39,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:25:39,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:25:39,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:25:39,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:25:39,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:25:39,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:25:39,566 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:25:39,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:25:39,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:25:39,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:25:39,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:25:39,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:25:39,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:25:39,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:25:39,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:25:39,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:25:39,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:25:39,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:25:39,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:25:39,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:25:39,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:25:39,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:25:39,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:25:39,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:25:39,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:25:39,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:25:39,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:25:39,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:25:39,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:25:39,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:25:39,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:25:39,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:25:39,574 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:25:39,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:25:39,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:25:39,575 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:25:39,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:25:39,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:25:39,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:25:39,849 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:25:39,849 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:25:39,850 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/mix016_pso.opt_tso.opt.yml/witness.yml [2024-05-12 11:25:40,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:25:40,074 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:25:40,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2024-05-12 11:25:41,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:25:41,474 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:25:41,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2024-05-12 11:25:41,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3427abfc6/b0fbb686cc784b9b97a491bc88ace09c/FLAG8c30c893f [2024-05-12 11:25:41,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3427abfc6/b0fbb686cc784b9b97a491bc88ace09c [2024-05-12 11:25:41,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:25:41,507 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:25:41,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:25:41,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:25:41,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:25:41,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:25:40" (1/2) ... [2024-05-12 11:25:41,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743b1bdf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:25:41, skipping insertion in model container [2024-05-12 11:25:41,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:25:40" (1/2) ... [2024-05-12 11:25:41,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4612f28a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:25:41, skipping insertion in model container [2024-05-12 11:25:41,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:25:41" (2/2) ... [2024-05-12 11:25:41,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743b1bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:41, skipping insertion in model container [2024-05-12 11:25:41,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:25:41" (2/2) ... [2024-05-12 11:25:41,517 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:25:41,621 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:25:41,622 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-05-12 11:25:41,623 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-05-12 11:25:41,624 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0) [2024-05-12 11:25:41,624 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:25:41,625 INFO L106 edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1; [2024-05-12 11:25:41,671 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:25:41,837 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/mix016_pso.opt_tso.opt.i[956,969] [2024-05-12 11:25:42,009 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:25:42,017 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:25:42,047 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/mix016_pso.opt_tso.opt.i[956,969] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:25:42,441 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:25:42,488 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:25:42,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42 WrapperNode [2024-05-12 11:25:42,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:25:42,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:25:42,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:25:42,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:25:42,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,679 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2024-05-12 11:25:42,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:25:42,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:25:42,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:25:42,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:25:42,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,768 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:25:42,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:25:42,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:25:42,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:25:42,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:25:42,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (1/1) ... [2024-05-12 11:25:42,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:25:42,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:25:42,921 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:25:42,927 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:25:42,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:25:42,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:25:42,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:25:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:25:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:25:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:25:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:25:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:25:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:25:42,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:25:42,962 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:25:42,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:25:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:25:42,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:25:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:25:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:25:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:25:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:25:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:25:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:25:42,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:25:42,967 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:25:43,143 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:25:43,146 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:25:44,678 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:25:44,679 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:25:45,068 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:25:45,072 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:25:45,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:25:45 BoogieIcfgContainer [2024-05-12 11:25:45,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:25:45,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:25:45,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:25:45,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:25:45,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:25:40" (1/4) ... [2024-05-12 11:25:45,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdd1f12 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:25:45, skipping insertion in model container [2024-05-12 11:25:45,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:25:41" (2/4) ... [2024-05-12 11:25:45,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdd1f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:25:45, skipping insertion in model container [2024-05-12 11:25:45,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:25:42" (3/4) ... [2024-05-12 11:25:45,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdd1f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:25:45, skipping insertion in model container [2024-05-12 11:25:45,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:25:45" (4/4) ... [2024-05-12 11:25:45,084 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2024-05-12 11:25:45,100 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:25:45,100 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:25:45,101 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:25:45,259 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:25:45,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow [2024-05-12 11:25:45,356 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-05-12 11:25:45,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:25:45,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-05-12 11:25:45,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow [2024-05-12 11:25:45,364 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow [2024-05-12 11:25:45,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:25:45,387 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;@61441551, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:25:45,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:25:45,397 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:25:45,398 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:25:45,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:25:45,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:45,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:25:45,399 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:25:45,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -965811045, now seen corresponding path program 1 times [2024-05-12 11:25:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:45,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342795807] [2024-05-12 11:25:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:25:53,128 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:25:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:25:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342795807] [2024-05-12 11:25:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342795807] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:25:53,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:25:53,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:25:53,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661330443] [2024-05-12 11:25:53,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:25:53,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:25:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:25:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:25:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:25:53,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-05-12 11:25:53,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:25:53,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:25:53,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-05-12 11:25:53,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:25:54,570 INFO L124 PetriNetUnfolderBase]: 2349/3983 cut-off events. [2024-05-12 11:25:54,570 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-05-12 11:25:54,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7463 conditions, 3983 events. 2349/3983 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 25908 event pairs, 1832 based on Foata normal form. 121/3760 useless extension candidates. Maximal degree in co-relation 7448. Up to 3411 conditions per place. [2024-05-12 11:25:54,598 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 41 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2024-05-12 11:25:54,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 225 flow [2024-05-12 11:25:54,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:25:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:25:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-05-12 11:25:54,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-05-12 11:25:54,613 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 99 transitions. [2024-05-12 11:25:54,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 225 flow [2024-05-12 11:25:54,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:25:54,622 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 131 flow [2024-05-12 11:25:54,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-05-12 11:25:54,627 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2024-05-12 11:25:54,627 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 131 flow [2024-05-12 11:25:54,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:25:54,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:25:54,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:25:54,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:25:54,628 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:25:54,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:25:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash -431444166, now seen corresponding path program 1 times [2024-05-12 11:25:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:25:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760530996] [2024-05-12 11:25:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:25:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:25:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:26:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:00,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760530996] [2024-05-12 11:26:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760530996] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:26:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488961391] [2024-05-12 11:26:00,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:00,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:26:00,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:00,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:26:00,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:26:00,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-05-12 11:26:00,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:00,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:00,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-05-12 11:26:00,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:01,360 INFO L124 PetriNetUnfolderBase]: 2679/4310 cut-off events. [2024-05-12 11:26:01,361 INFO L125 PetriNetUnfolderBase]: For 639/639 co-relation queries the response was YES. [2024-05-12 11:26:01,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9281 conditions, 4310 events. 2679/4310 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 26518 event pairs, 1372 based on Foata normal form. 3/4047 useless extension candidates. Maximal degree in co-relation 9266. Up to 3855 conditions per place. [2024-05-12 11:26:01,390 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 53 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2024-05-12 11:26:01,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 321 flow [2024-05-12 11:26:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:26:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:26:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-05-12 11:26:01,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6510416666666666 [2024-05-12 11:26:01,398 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 131 flow. Second operand 4 states and 125 transitions. [2024-05-12 11:26:01,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 321 flow [2024-05-12 11:26:01,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:26:01,401 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 177 flow [2024-05-12 11:26:01,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-05-12 11:26:01,402 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2024-05-12 11:26:01,402 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 177 flow [2024-05-12 11:26:01,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:26:01,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:01,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:01,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:26:01,403 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:26:01,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1685088749, now seen corresponding path program 1 times [2024-05-12 11:26:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:01,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958217219] [2024-05-12 11:26:01,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:06,767 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:26:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958217219] [2024-05-12 11:26:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958217219] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:26:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769763834] [2024-05-12 11:26:06,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:06,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:26:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:06,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:26:06,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:26:06,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:26:06,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 177 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:26:06,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:06,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:26:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:08,538 INFO L124 PetriNetUnfolderBase]: 3410/5649 cut-off events. [2024-05-12 11:26:08,538 INFO L125 PetriNetUnfolderBase]: For 2221/2221 co-relation queries the response was YES. [2024-05-12 11:26:08,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12994 conditions, 5649 events. 3410/5649 cut-off events. For 2221/2221 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 36761 event pairs, 1650 based on Foata normal form. 6/5278 useless extension candidates. Maximal degree in co-relation 12977. Up to 4812 conditions per place. [2024-05-12 11:26:08,571 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 73 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-05-12 11:26:08,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 488 flow [2024-05-12 11:26:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:26:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:26:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2024-05-12 11:26:08,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-05-12 11:26:08,574 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 177 flow. Second operand 6 states and 176 transitions. [2024-05-12 11:26:08,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 488 flow [2024-05-12 11:26:08,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 460 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 11:26:08,578 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 237 flow [2024-05-12 11:26:08,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-05-12 11:26:08,579 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2024-05-12 11:26:08,580 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 237 flow [2024-05-12 11:26:08,580 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:26:08,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:08,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:08,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:26:08,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:26:08,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:08,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1075645688, now seen corresponding path program 1 times [2024-05-12 11:26:08,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:08,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34653456] [2024-05-12 11:26:08,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:18,756 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:26:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34653456] [2024-05-12 11:26:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34653456] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:18,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:26:18,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736726194] [2024-05-12 11:26:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:26:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:26:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:26:18,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:26:18,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 237 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:26:18,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:18,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:26:18,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:20,527 INFO L124 PetriNetUnfolderBase]: 3398/5166 cut-off events. [2024-05-12 11:26:20,527 INFO L125 PetriNetUnfolderBase]: For 3568/3568 co-relation queries the response was YES. [2024-05-12 11:26:20,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13676 conditions, 5166 events. 3398/5166 cut-off events. For 3568/3568 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 29608 event pairs, 1074 based on Foata normal form. 4/4966 useless extension candidates. Maximal degree in co-relation 13657. Up to 4849 conditions per place. [2024-05-12 11:26:20,555 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 63 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2024-05-12 11:26:20,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 455 flow [2024-05-12 11:26:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:26:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:26:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-05-12 11:26:20,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2024-05-12 11:26:20,557 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 237 flow. Second operand 5 states and 134 transitions. [2024-05-12 11:26:20,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 455 flow [2024-05-12 11:26:20,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 417 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 11:26:20,562 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 258 flow [2024-05-12 11:26:20,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2024-05-12 11:26:20,562 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2024-05-12 11:26:20,563 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 258 flow [2024-05-12 11:26:20,563 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:26:20,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:20,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:20,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:26:20,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:26:20,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:20,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1054507330, now seen corresponding path program 1 times [2024-05-12 11:26:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:20,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803155917] [2024-05-12 11:26:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:20,899 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:26:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803155917] [2024-05-12 11:26:20,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803155917] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:20,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:20,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:26:20,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831310900] [2024-05-12 11:26:20,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:20,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:26:20,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:20,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:26:20,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:26:20,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 48 [2024-05-12 11:26:20,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 258 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:26:20,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:20,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 48 [2024-05-12 11:26:20,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:21,425 INFO L124 PetriNetUnfolderBase]: 1103/2214 cut-off events. [2024-05-12 11:26:21,425 INFO L125 PetriNetUnfolderBase]: For 1691/1748 co-relation queries the response was YES. [2024-05-12 11:26:21,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5031 conditions, 2214 events. 1103/2214 cut-off events. For 1691/1748 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16037 event pairs, 209 based on Foata normal form. 2/2046 useless extension candidates. Maximal degree in co-relation 5010. Up to 1407 conditions per place. [2024-05-12 11:26:21,440 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 28 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2024-05-12 11:26:21,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 304 flow [2024-05-12 11:26:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:26:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:26:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-05-12 11:26:21,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7152777777777778 [2024-05-12 11:26:21,449 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 258 flow. Second operand 3 states and 103 transitions. [2024-05-12 11:26:21,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 304 flow [2024-05-12 11:26:21,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 284 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 11:26:21,456 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 212 flow [2024-05-12 11:26:21,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-05-12 11:26:21,457 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2024-05-12 11:26:21,457 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 212 flow [2024-05-12 11:26:21,458 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:26:21,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:21,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:21,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:26:21,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:26:21,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1357563665, now seen corresponding path program 1 times [2024-05-12 11:26:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549215979] [2024-05-12 11:26:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:31,843 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:26:31,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:31,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549215979] [2024-05-12 11:26:31,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549215979] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:31,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:31,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:26:31,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223822014] [2024-05-12 11:26:31,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:31,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:26:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:26:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:26:31,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:26:31,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 212 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:26:31,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:31,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:26:31,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:33,416 INFO L124 PetriNetUnfolderBase]: 3457/5057 cut-off events. [2024-05-12 11:26:33,417 INFO L125 PetriNetUnfolderBase]: For 6293/6293 co-relation queries the response was YES. [2024-05-12 11:26:33,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14073 conditions, 5057 events. 3457/5057 cut-off events. For 6293/6293 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 27259 event pairs, 997 based on Foata normal form. 4/5052 useless extension candidates. Maximal degree in co-relation 14053. Up to 4811 conditions per place. [2024-05-12 11:26:33,447 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 70 selfloop transitions, 16 changer transitions 4/100 dead transitions. [2024-05-12 11:26:33,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 534 flow [2024-05-12 11:26:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:26:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:26:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-05-12 11:26:33,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590277777777778 [2024-05-12 11:26:33,449 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 212 flow. Second operand 6 states and 161 transitions. [2024-05-12 11:26:33,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 534 flow [2024-05-12 11:26:33,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:26:33,455 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 278 flow [2024-05-12 11:26:33,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-05-12 11:26:33,456 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2024-05-12 11:26:33,456 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 278 flow [2024-05-12 11:26:33,456 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:26:33,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:33,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:33,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:26:33,457 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:26:33,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1351169915, now seen corresponding path program 2 times [2024-05-12 11:26:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231335551] [2024-05-12 11:26:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:43,232 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:26:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231335551] [2024-05-12 11:26:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231335551] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:26:43,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318303987] [2024-05-12 11:26:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:43,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:26:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:26:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:26:43,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:26:43,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 278 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:26:43,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:43,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:26:43,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:44,900 INFO L124 PetriNetUnfolderBase]: 3011/4419 cut-off events. [2024-05-12 11:26:44,900 INFO L125 PetriNetUnfolderBase]: For 7152/7152 co-relation queries the response was YES. [2024-05-12 11:26:44,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13180 conditions, 4419 events. 3011/4419 cut-off events. For 7152/7152 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23426 event pairs, 879 based on Foata normal form. 4/4419 useless extension candidates. Maximal degree in co-relation 13158. Up to 4206 conditions per place. [2024-05-12 11:26:44,926 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 83 selfloop transitions, 17 changer transitions 0/110 dead transitions. [2024-05-12 11:26:44,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 590 flow [2024-05-12 11:26:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:26:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:26:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-05-12 11:26:44,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-05-12 11:26:44,928 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 278 flow. Second operand 8 states and 201 transitions. [2024-05-12 11:26:44,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 590 flow [2024-05-12 11:26:44,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 110 transitions, 560 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-05-12 11:26:44,938 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 290 flow [2024-05-12 11:26:44,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=290, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2024-05-12 11:26:44,939 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2024-05-12 11:26:44,939 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 290 flow [2024-05-12 11:26:44,939 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:26:44,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:44,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:44,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:26:44,940 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:26:44,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 860466301, now seen corresponding path program 1 times [2024-05-12 11:26:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:44,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649213526] [2024-05-12 11:26:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:44,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:26:55,728 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:26:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:26:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649213526] [2024-05-12 11:26:55,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649213526] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:26:55,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:26:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:26:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803184849] [2024-05-12 11:26:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:26:55,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:26:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:26:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:26:55,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:26:55,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:26:55,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 290 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:26:55,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:26:55,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:26:55,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:26:57,565 INFO L124 PetriNetUnfolderBase]: 3057/4507 cut-off events. [2024-05-12 11:26:57,565 INFO L125 PetriNetUnfolderBase]: For 7922/7922 co-relation queries the response was YES. [2024-05-12 11:26:57,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13474 conditions, 4507 events. 3057/4507 cut-off events. For 7922/7922 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 24235 event pairs, 957 based on Foata normal form. 4/4507 useless extension candidates. Maximal degree in co-relation 13450. Up to 4324 conditions per place. [2024-05-12 11:26:57,591 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 82 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2024-05-12 11:26:57,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 602 flow [2024-05-12 11:26:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:26:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:26:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-05-12 11:26:57,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2024-05-12 11:26:57,593 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 290 flow. Second operand 7 states and 178 transitions. [2024-05-12 11:26:57,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 602 flow [2024-05-12 11:26:57,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 556 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 11:26:57,605 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 308 flow [2024-05-12 11:26:57,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-05-12 11:26:57,607 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2024-05-12 11:26:57,607 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 308 flow [2024-05-12 11:26:57,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:26:57,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:26:57,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:26:57,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:26:57,608 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:26:57,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:26:57,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1357260887, now seen corresponding path program 2 times [2024-05-12 11:26:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:26:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744109440] [2024-05-12 11:26:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:26:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:26:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:08,229 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:27:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744109440] [2024-05-12 11:27:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744109440] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:27:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342507851] [2024-05-12 11:27:08,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:08,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:27:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:27:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:27:08,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:27:08,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 308 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:27:08,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:08,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:27:08,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:09,948 INFO L124 PetriNetUnfolderBase]: 3103/4593 cut-off events. [2024-05-12 11:27:09,948 INFO L125 PetriNetUnfolderBase]: For 10741/10741 co-relation queries the response was YES. [2024-05-12 11:27:09,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14473 conditions, 4593 events. 3103/4593 cut-off events. For 10741/10741 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 24879 event pairs, 805 based on Foata normal form. 4/4588 useless extension candidates. Maximal degree in co-relation 14449. Up to 4185 conditions per place. [2024-05-12 11:27:09,972 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 78 selfloop transitions, 26 changer transitions 0/114 dead transitions. [2024-05-12 11:27:09,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 700 flow [2024-05-12 11:27:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:27:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:27:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-05-12 11:27:09,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-05-12 11:27:09,975 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 308 flow. Second operand 7 states and 184 transitions. [2024-05-12 11:27:09,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 700 flow [2024-05-12 11:27:09,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 660 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-05-12 11:27:09,985 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 390 flow [2024-05-12 11:27:09,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=390, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2024-05-12 11:27:09,986 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2024-05-12 11:27:09,986 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 390 flow [2024-05-12 11:27:09,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:27:09,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:09,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:09,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:27:09,989 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:27:09,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1030339253, now seen corresponding path program 3 times [2024-05-12 11:27:09,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138486635] [2024-05-12 11:27:09,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:20,347 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:27:20,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:20,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138486635] [2024-05-12 11:27:20,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138486635] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:20,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:20,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:27:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067127242] [2024-05-12 11:27:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:20,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:27:20,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:27:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:27:20,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:27:20,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 390 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:27:20,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:20,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:27:20,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:22,258 INFO L124 PetriNetUnfolderBase]: 3093/4573 cut-off events. [2024-05-12 11:27:22,258 INFO L125 PetriNetUnfolderBase]: For 14041/14041 co-relation queries the response was YES. [2024-05-12 11:27:22,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15234 conditions, 4573 events. 3093/4573 cut-off events. For 14041/14041 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 24709 event pairs, 798 based on Foata normal form. 4/4573 useless extension candidates. Maximal degree in co-relation 15209. Up to 4177 conditions per place. [2024-05-12 11:27:22,283 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 91 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2024-05-12 11:27:22,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 758 flow [2024-05-12 11:27:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:27:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:27:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-05-12 11:27:22,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-05-12 11:27:22,285 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 390 flow. Second operand 9 states and 228 transitions. [2024-05-12 11:27:22,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 758 flow [2024-05-12 11:27:22,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 128 transitions, 706 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-05-12 11:27:22,302 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 400 flow [2024-05-12 11:27:22,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=400, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2024-05-12 11:27:22,303 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2024-05-12 11:27:22,303 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 400 flow [2024-05-12 11:27:22,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:27:22,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:22,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:22,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:27:22,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:27:22,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash -188462203, now seen corresponding path program 1 times [2024-05-12 11:27:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:22,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352393752] [2024-05-12 11:27:22,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:27:31,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:31,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352393752] [2024-05-12 11:27:31,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352393752] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:31,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:31,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:27:31,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909216796] [2024-05-12 11:27:31,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:31,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:27:31,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:31,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:27:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:27:31,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:27:31,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 400 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:27:31,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:31,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:27:31,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:33,103 INFO L124 PetriNetUnfolderBase]: 2655/4114 cut-off events. [2024-05-12 11:27:33,103 INFO L125 PetriNetUnfolderBase]: For 12837/12837 co-relation queries the response was YES. [2024-05-12 11:27:33,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13687 conditions, 4114 events. 2655/4114 cut-off events. For 12837/12837 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 23175 event pairs, 706 based on Foata normal form. 4/4101 useless extension candidates. Maximal degree in co-relation 13660. Up to 3769 conditions per place. [2024-05-12 11:27:33,125 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 87 selfloop transitions, 13 changer transitions 0/111 dead transitions. [2024-05-12 11:27:33,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 111 transitions, 723 flow [2024-05-12 11:27:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:27:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:27:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-05-12 11:27:33,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-05-12 11:27:33,127 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 400 flow. Second operand 7 states and 177 transitions. [2024-05-12 11:27:33,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 111 transitions, 723 flow [2024-05-12 11:27:33,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 648 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-05-12 11:27:33,139 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 409 flow [2024-05-12 11:27:33,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2024-05-12 11:27:33,140 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2024-05-12 11:27:33,140 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 409 flow [2024-05-12 11:27:33,141 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:27:33,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:33,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:33,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:27:33,141 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:27:33,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash 230700209, now seen corresponding path program 1 times [2024-05-12 11:27:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790727734] [2024-05-12 11:27:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:33,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:43,601 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:27:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:43,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790727734] [2024-05-12 11:27:43,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790727734] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:43,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:43,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:27:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507962327] [2024-05-12 11:27:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:43,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:27:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:43,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:27:43,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:27:43,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-05-12 11:27:43,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 409 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:43,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:43,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-05-12 11:27:43,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:44,915 INFO L124 PetriNetUnfolderBase]: 2432/4130 cut-off events. [2024-05-12 11:27:44,915 INFO L125 PetriNetUnfolderBase]: For 15037/15037 co-relation queries the response was YES. [2024-05-12 11:27:44,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13616 conditions, 4130 events. 2432/4130 cut-off events. For 15037/15037 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 26418 event pairs, 1024 based on Foata normal form. 1/4035 useless extension candidates. Maximal degree in co-relation 13587. Up to 3527 conditions per place. [2024-05-12 11:27:44,934 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 72 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2024-05-12 11:27:44,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 648 flow [2024-05-12 11:27:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:27:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:27:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-05-12 11:27:44,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-05-12 11:27:44,935 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 409 flow. Second operand 5 states and 126 transitions. [2024-05-12 11:27:44,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 648 flow [2024-05-12 11:27:44,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 96 transitions, 603 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-05-12 11:27:44,946 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 452 flow [2024-05-12 11:27:44,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-05-12 11:27:44,947 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2024-05-12 11:27:44,947 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 452 flow [2024-05-12 11:27:44,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:27:44,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:44,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:27:44,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:27:44,948 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:27:44,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1483807172, now seen corresponding path program 1 times [2024-05-12 11:27:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:44,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830657598] [2024-05-12 11:27:44,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:27:57,049 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:27:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:27:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830657598] [2024-05-12 11:27:57,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830657598] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:27:57,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:27:57,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:27:57,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280918722] [2024-05-12 11:27:57,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:27:57,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:27:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:27:57,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:27:57,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:27:57,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 48 [2024-05-12 11:27:57,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 452 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 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:27:57,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:27:57,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 48 [2024-05-12 11:27:57,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:27:58,528 INFO L124 PetriNetUnfolderBase]: 2436/4089 cut-off events. [2024-05-12 11:27:58,528 INFO L125 PetriNetUnfolderBase]: For 17048/17048 co-relation queries the response was YES. [2024-05-12 11:27:58,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14252 conditions, 4089 events. 2436/4089 cut-off events. For 17048/17048 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25818 event pairs, 1021 based on Foata normal form. 2/4007 useless extension candidates. Maximal degree in co-relation 14221. Up to 3511 conditions per place. [2024-05-12 11:27:58,551 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 78 selfloop transitions, 12 changer transitions 0/105 dead transitions. [2024-05-12 11:27:58,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 105 transitions, 702 flow [2024-05-12 11:27:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:27:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:27:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-05-12 11:27:58,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-05-12 11:27:58,552 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 452 flow. Second operand 6 states and 150 transitions. [2024-05-12 11:27:58,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 105 transitions, 702 flow [2024-05-12 11:27:58,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 681 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 11:27:58,566 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 489 flow [2024-05-12 11:27:58,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=489, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2024-05-12 11:27:58,567 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2024-05-12 11:27:58,567 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 489 flow [2024-05-12 11:27:58,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 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:27:58,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:27:58,567 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:27:58,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:27:58,568 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:27:58,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:27:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1460439308, now seen corresponding path program 1 times [2024-05-12 11:27:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:27:58,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625502402] [2024-05-12 11:27:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:27:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:27:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:28:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625502402] [2024-05-12 11:28:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625502402] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:10,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:10,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:28:10,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731878100] [2024-05-12 11:28:10,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:10,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:28:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:28:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:28:10,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:28:10,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 489 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:28:10,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:10,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:28:10,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:12,378 INFO L124 PetriNetUnfolderBase]: 3426/5618 cut-off events. [2024-05-12 11:28:12,378 INFO L125 PetriNetUnfolderBase]: For 29014/29014 co-relation queries the response was YES. [2024-05-12 11:28:12,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20596 conditions, 5618 events. 3426/5618 cut-off events. For 29014/29014 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 34930 event pairs, 878 based on Foata normal form. 16/5464 useless extension candidates. Maximal degree in co-relation 20563. Up to 4401 conditions per place. [2024-05-12 11:28:12,403 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 124 selfloop transitions, 21 changer transitions 0/155 dead transitions. [2024-05-12 11:28:12,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 155 transitions, 1051 flow [2024-05-12 11:28:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:28:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:28:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions. [2024-05-12 11:28:12,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-05-12 11:28:12,405 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 489 flow. Second operand 9 states and 234 transitions. [2024-05-12 11:28:12,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 155 transitions, 1051 flow [2024-05-12 11:28:12,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 155 transitions, 1015 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 11:28:12,428 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 539 flow [2024-05-12 11:28:12,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=539, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2024-05-12 11:28:12,429 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places. [2024-05-12 11:28:12,429 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 539 flow [2024-05-12 11:28:12,429 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:28:12,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:12,430 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:28:12,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:28:12,430 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:28:12,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2023314978, now seen corresponding path program 2 times [2024-05-12 11:28:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155268374] [2024-05-12 11:28:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:23,697 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:28:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:23,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155268374] [2024-05-12 11:28:23,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155268374] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:23,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:23,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:28:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509514869] [2024-05-12 11:28:23,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:23,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:28:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:23,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:28:23,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:28:23,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:28:23,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 539 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:28:23,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:23,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:28:23,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:25,827 INFO L124 PetriNetUnfolderBase]: 3390/5582 cut-off events. [2024-05-12 11:28:25,827 INFO L125 PetriNetUnfolderBase]: For 30898/30898 co-relation queries the response was YES. [2024-05-12 11:28:25,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20513 conditions, 5582 events. 3390/5582 cut-off events. For 30898/30898 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 34751 event pairs, 1155 based on Foata normal form. 20/5421 useless extension candidates. Maximal degree in co-relation 20479. Up to 4609 conditions per place. [2024-05-12 11:28:25,853 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 113 selfloop transitions, 18 changer transitions 0/141 dead transitions. [2024-05-12 11:28:25,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 951 flow [2024-05-12 11:28:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:28:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:28:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-05-12 11:28:25,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338541666666666 [2024-05-12 11:28:25,855 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 539 flow. Second operand 8 states and 205 transitions. [2024-05-12 11:28:25,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 951 flow [2024-05-12 11:28:25,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 141 transitions, 917 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 11:28:25,875 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 548 flow [2024-05-12 11:28:25,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=548, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2024-05-12 11:28:25,876 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 37 predicate places. [2024-05-12 11:28:25,876 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 548 flow [2024-05-12 11:28:25,876 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:28:25,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:25,877 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:28:25,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:28:25,877 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:28:25,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1905227298, now seen corresponding path program 3 times [2024-05-12 11:28:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098178828] [2024-05-12 11:28:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:34,891 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:28:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:34,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098178828] [2024-05-12 11:28:34,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098178828] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:34,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:34,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:28:34,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83524755] [2024-05-12 11:28:34,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:34,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:28:34,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:28:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:28:35,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:28:35,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 548 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:28:35,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:35,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:28:35,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:36,946 INFO L124 PetriNetUnfolderBase]: 3557/5799 cut-off events. [2024-05-12 11:28:36,946 INFO L125 PetriNetUnfolderBase]: For 34270/34273 co-relation queries the response was YES. [2024-05-12 11:28:36,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21768 conditions, 5799 events. 3557/5799 cut-off events. For 34270/34273 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 35994 event pairs, 1003 based on Foata normal form. 20/5648 useless extension candidates. Maximal degree in co-relation 21732. Up to 4669 conditions per place. [2024-05-12 11:28:36,977 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 101 selfloop transitions, 31 changer transitions 0/142 dead transitions. [2024-05-12 11:28:36,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 142 transitions, 986 flow [2024-05-12 11:28:36,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:28:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:28:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2024-05-12 11:28:36,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5442708333333334 [2024-05-12 11:28:36,979 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 548 flow. Second operand 8 states and 209 transitions. [2024-05-12 11:28:36,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 142 transitions, 986 flow [2024-05-12 11:28:36,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 142 transitions, 945 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-05-12 11:28:37,000 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 598 flow [2024-05-12 11:28:37,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=598, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-05-12 11:28:37,000 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2024-05-12 11:28:37,000 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 598 flow [2024-05-12 11:28:37,001 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:28:37,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:37,001 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:28:37,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:28:37,001 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:28:37,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1905042600, now seen corresponding path program 1 times [2024-05-12 11:28:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:37,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328385319] [2024-05-12 11:28:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:45,280 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:28:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328385319] [2024-05-12 11:28:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328385319] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:45,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:45,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:28:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663848510] [2024-05-12 11:28:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:45,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:28:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:45,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:28:45,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:28:45,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-05-12 11:28:45,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 598 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:28:45,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:45,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-05-12 11:28:45,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:47,467 INFO L124 PetriNetUnfolderBase]: 4128/6721 cut-off events. [2024-05-12 11:28:47,468 INFO L125 PetriNetUnfolderBase]: For 40652/40655 co-relation queries the response was YES. [2024-05-12 11:28:47,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25288 conditions, 6721 events. 4128/6721 cut-off events. For 40652/40655 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 42949 event pairs, 1371 based on Foata normal form. 4/6508 useless extension candidates. Maximal degree in co-relation 25251. Up to 5818 conditions per place. [2024-05-12 11:28:47,503 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 123 selfloop transitions, 32 changer transitions 0/164 dead transitions. [2024-05-12 11:28:47,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1257 flow [2024-05-12 11:28:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:28:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:28:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-05-12 11:28:47,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-05-12 11:28:47,507 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 598 flow. Second operand 9 states and 212 transitions. [2024-05-12 11:28:47,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1257 flow [2024-05-12 11:28:47,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 164 transitions, 1152 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 11:28:47,557 INFO L231 Difference]: Finished difference. Result has 98 places, 117 transitions, 852 flow [2024-05-12 11:28:47,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=852, PETRI_PLACES=98, PETRI_TRANSITIONS=117} [2024-05-12 11:28:47,557 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 44 predicate places. [2024-05-12 11:28:47,558 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 117 transitions, 852 flow [2024-05-12 11:28:47,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:28:47,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:47,558 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:28:47,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:28:47,558 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:28:47,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash 748761942, now seen corresponding path program 1 times [2024-05-12 11:28:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:47,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986817727] [2024-05-12 11:28:47,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:28:57,667 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:28:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:28:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986817727] [2024-05-12 11:28:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986817727] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:28:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:28:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:28:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599614735] [2024-05-12 11:28:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:28:57,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:28:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:28:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:28:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:28:57,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:28:57,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 117 transitions, 852 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:57,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:28:57,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:28:57,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:28:59,361 INFO L124 PetriNetUnfolderBase]: 3401/5614 cut-off events. [2024-05-12 11:28:59,361 INFO L125 PetriNetUnfolderBase]: For 39954/39966 co-relation queries the response was YES. [2024-05-12 11:28:59,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22424 conditions, 5614 events. 3401/5614 cut-off events. For 39954/39966 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 36459 event pairs, 1260 based on Foata normal form. 10/5479 useless extension candidates. Maximal degree in co-relation 22383. Up to 4889 conditions per place. [2024-05-12 11:28:59,393 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 109 selfloop transitions, 15 changer transitions 0/149 dead transitions. [2024-05-12 11:28:59,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 149 transitions, 1224 flow [2024-05-12 11:28:59,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:28:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:28:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-05-12 11:28:59,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-05-12 11:28:59,395 INFO L175 Difference]: Start difference. First operand has 98 places, 117 transitions, 852 flow. Second operand 6 states and 149 transitions. [2024-05-12 11:28:59,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 149 transitions, 1224 flow [2024-05-12 11:28:59,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 149 transitions, 1198 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-05-12 11:28:59,420 INFO L231 Difference]: Finished difference. Result has 104 places, 126 transitions, 956 flow [2024-05-12 11:28:59,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=956, PETRI_PLACES=104, PETRI_TRANSITIONS=126} [2024-05-12 11:28:59,421 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 50 predicate places. [2024-05-12 11:28:59,421 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 126 transitions, 956 flow [2024-05-12 11:28:59,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:28:59,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:28:59,421 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:28:59,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:28:59,422 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:28:59,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:28:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1377374998, now seen corresponding path program 4 times [2024-05-12 11:28:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:28:59,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271665404] [2024-05-12 11:28:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:28:59,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:28:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:10,705 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:29:10,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:10,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271665404] [2024-05-12 11:29:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271665404] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:10,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:10,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:29:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842234695] [2024-05-12 11:29:10,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:10,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:29:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:10,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:29:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:29:10,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:29:10,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 126 transitions, 956 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:29:10,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:10,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:29:10,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:12,934 INFO L124 PetriNetUnfolderBase]: 3739/5941 cut-off events. [2024-05-12 11:29:12,934 INFO L125 PetriNetUnfolderBase]: For 47120/47120 co-relation queries the response was YES. [2024-05-12 11:29:12,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25001 conditions, 5941 events. 3739/5941 cut-off events. For 47120/47120 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 36751 event pairs, 1171 based on Foata normal form. 20/5843 useless extension candidates. Maximal degree in co-relation 24956. Up to 4917 conditions per place. [2024-05-12 11:29:12,970 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 125 selfloop transitions, 55 changer transitions 0/195 dead transitions. [2024-05-12 11:29:12,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 195 transitions, 1546 flow [2024-05-12 11:29:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:29:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:29:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2024-05-12 11:29:12,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-05-12 11:29:12,979 INFO L175 Difference]: Start difference. First operand has 104 places, 126 transitions, 956 flow. Second operand 10 states and 255 transitions. [2024-05-12 11:29:12,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 195 transitions, 1546 flow [2024-05-12 11:29:13,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 195 transitions, 1508 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 11:29:13,019 INFO L231 Difference]: Finished difference. Result has 111 places, 127 transitions, 1061 flow [2024-05-12 11:29:13,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1061, PETRI_PLACES=111, PETRI_TRANSITIONS=127} [2024-05-12 11:29:13,019 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 57 predicate places. [2024-05-12 11:29:13,019 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 127 transitions, 1061 flow [2024-05-12 11:29:13,020 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:29:13,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:13,020 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:29:13,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:29:13,020 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:29:13,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash -732070108, now seen corresponding path program 2 times [2024-05-12 11:29:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:13,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912340131] [2024-05-12 11:29:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:22,370 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:29:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912340131] [2024-05-12 11:29:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912340131] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:22,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:22,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:29:22,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133915112] [2024-05-12 11:29:22,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:22,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:29:22,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:22,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:29:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:29:22,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:29:22,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 127 transitions, 1061 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:29:22,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:22,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:29:22,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:24,525 INFO L124 PetriNetUnfolderBase]: 3803/6031 cut-off events. [2024-05-12 11:29:24,525 INFO L125 PetriNetUnfolderBase]: For 50974/50990 co-relation queries the response was YES. [2024-05-12 11:29:24,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25995 conditions, 6031 events. 3803/6031 cut-off events. For 50974/50990 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 37213 event pairs, 1232 based on Foata normal form. 16/5928 useless extension candidates. Maximal degree in co-relation 25949. Up to 5340 conditions per place. [2024-05-12 11:29:24,561 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 114 selfloop transitions, 57 changer transitions 0/186 dead transitions. [2024-05-12 11:29:24,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 186 transitions, 1687 flow [2024-05-12 11:29:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:29:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:29:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-05-12 11:29:24,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-05-12 11:29:24,563 INFO L175 Difference]: Start difference. First operand has 111 places, 127 transitions, 1061 flow. Second operand 8 states and 198 transitions. [2024-05-12 11:29:24,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 186 transitions, 1687 flow [2024-05-12 11:29:24,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 186 transitions, 1546 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-05-12 11:29:24,598 INFO L231 Difference]: Finished difference. Result has 112 places, 142 transitions, 1232 flow [2024-05-12 11:29:24,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1232, PETRI_PLACES=112, PETRI_TRANSITIONS=142} [2024-05-12 11:29:24,599 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places. [2024-05-12 11:29:24,599 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 142 transitions, 1232 flow [2024-05-12 11:29:24,599 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:29:24,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:24,599 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:29:24,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:29:24,600 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:29:24,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1732908346, now seen corresponding path program 3 times [2024-05-12 11:29:24,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:24,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092511087] [2024-05-12 11:29:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:32,586 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:29:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092511087] [2024-05-12 11:29:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092511087] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:29:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958242350] [2024-05-12 11:29:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:32,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:29:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:32,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:29:32,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:29:32,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:29:32,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 142 transitions, 1232 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:29:32,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:32,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:29:32,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:34,775 INFO L124 PetriNetUnfolderBase]: 3839/6121 cut-off events. [2024-05-12 11:29:34,775 INFO L125 PetriNetUnfolderBase]: For 53731/53745 co-relation queries the response was YES. [2024-05-12 11:29:34,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26760 conditions, 6121 events. 3839/6121 cut-off events. For 53731/53745 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 37997 event pairs, 1095 based on Foata normal form. 16/6006 useless extension candidates. Maximal degree in co-relation 26712. Up to 5236 conditions per place. [2024-05-12 11:29:34,814 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 115 selfloop transitions, 65 changer transitions 0/195 dead transitions. [2024-05-12 11:29:34,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 195 transitions, 1882 flow [2024-05-12 11:29:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:29:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:29:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-05-12 11:29:34,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:29:34,816 INFO L175 Difference]: Start difference. First operand has 112 places, 142 transitions, 1232 flow. Second operand 9 states and 216 transitions. [2024-05-12 11:29:34,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 195 transitions, 1882 flow [2024-05-12 11:29:34,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 195 transitions, 1788 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-05-12 11:29:34,858 INFO L231 Difference]: Finished difference. Result has 119 places, 148 transitions, 1368 flow [2024-05-12 11:29:34,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1368, PETRI_PLACES=119, PETRI_TRANSITIONS=148} [2024-05-12 11:29:34,859 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 65 predicate places. [2024-05-12 11:29:34,859 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 148 transitions, 1368 flow [2024-05-12 11:29:34,859 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:29:34,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:34,859 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:29:34,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:29:34,860 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:29:34,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:34,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1176467346, now seen corresponding path program 4 times [2024-05-12 11:29:34,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:34,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20403885] [2024-05-12 11:29:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:34,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:29:44,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20403885] [2024-05-12 11:29:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20403885] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:44,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:44,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:29:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545361122] [2024-05-12 11:29:44,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:44,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:29:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:29:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:29:44,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:29:44,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 148 transitions, 1368 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:29:44,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:44,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:29:44,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:46,847 INFO L124 PetriNetUnfolderBase]: 3956/6276 cut-off events. [2024-05-12 11:29:46,847 INFO L125 PetriNetUnfolderBase]: For 56247/56257 co-relation queries the response was YES. [2024-05-12 11:29:46,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27053 conditions, 6276 events. 3956/6276 cut-off events. For 56247/56257 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 38709 event pairs, 1304 based on Foata normal form. 12/6166 useless extension candidates. Maximal degree in co-relation 27003. Up to 5566 conditions per place. [2024-05-12 11:29:46,884 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 121 selfloop transitions, 58 changer transitions 0/194 dead transitions. [2024-05-12 11:29:46,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 194 transitions, 1893 flow [2024-05-12 11:29:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:29:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:29:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-05-12 11:29:46,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182291666666666 [2024-05-12 11:29:46,886 INFO L175 Difference]: Start difference. First operand has 119 places, 148 transitions, 1368 flow. Second operand 8 states and 199 transitions. [2024-05-12 11:29:46,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 194 transitions, 1893 flow [2024-05-12 11:29:46,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 194 transitions, 1767 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-05-12 11:29:46,942 INFO L231 Difference]: Finished difference. Result has 125 places, 151 transitions, 1438 flow [2024-05-12 11:29:46,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1438, PETRI_PLACES=125, PETRI_TRANSITIONS=151} [2024-05-12 11:29:46,942 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 71 predicate places. [2024-05-12 11:29:46,943 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 151 transitions, 1438 flow [2024-05-12 11:29:46,943 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:29:46,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:46,943 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:29:46,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:29:46,943 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:29:46,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1246604246, now seen corresponding path program 2 times [2024-05-12 11:29:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658033680] [2024-05-12 11:29:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:29:57,413 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:29:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:29:57,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658033680] [2024-05-12 11:29:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658033680] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:29:57,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:29:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:29:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249201474] [2024-05-12 11:29:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:29:57,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:29:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:29:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:29:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:29:57,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:29:57,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 151 transitions, 1438 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:57,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:29:57,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:29:57,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:29:59,329 INFO L124 PetriNetUnfolderBase]: 3579/5990 cut-off events. [2024-05-12 11:29:59,329 INFO L125 PetriNetUnfolderBase]: For 56645/56655 co-relation queries the response was YES. [2024-05-12 11:29:59,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25302 conditions, 5990 events. 3579/5990 cut-off events. For 56645/56655 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 39833 event pairs, 1339 based on Foata normal form. 12/5849 useless extension candidates. Maximal degree in co-relation 25248. Up to 5116 conditions per place. [2024-05-12 11:29:59,369 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 126 selfloop transitions, 21 changer transitions 0/182 dead transitions. [2024-05-12 11:29:59,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 182 transitions, 1839 flow [2024-05-12 11:29:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:29:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:29:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 11:29:59,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-05-12 11:29:59,370 INFO L175 Difference]: Start difference. First operand has 125 places, 151 transitions, 1438 flow. Second operand 7 states and 172 transitions. [2024-05-12 11:29:59,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 182 transitions, 1839 flow [2024-05-12 11:29:59,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 182 transitions, 1715 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 11:29:59,409 INFO L231 Difference]: Finished difference. Result has 127 places, 154 transitions, 1398 flow [2024-05-12 11:29:59,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1398, PETRI_PLACES=127, PETRI_TRANSITIONS=154} [2024-05-12 11:29:59,410 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 73 predicate places. [2024-05-12 11:29:59,410 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 154 transitions, 1398 flow [2024-05-12 11:29:59,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:29:59,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:29:59,410 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:29:59,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:29:59,410 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:29:59,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:29:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1240866518, now seen corresponding path program 1 times [2024-05-12 11:29:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:29:59,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151904849] [2024-05-12 11:29:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:29:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:29:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:09,438 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:30:09,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151904849] [2024-05-12 11:30:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151904849] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:09,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:09,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:30:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553654082] [2024-05-12 11:30:09,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:09,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:30:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:30:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:30:09,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:30:09,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 154 transitions, 1398 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:30:09,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:09,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:30:09,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:11,202 INFO L124 PetriNetUnfolderBase]: 3444/5771 cut-off events. [2024-05-12 11:30:11,202 INFO L125 PetriNetUnfolderBase]: For 53584/53584 co-relation queries the response was YES. [2024-05-12 11:30:11,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25031 conditions, 5771 events. 3444/5771 cut-off events. For 53584/53584 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 37711 event pairs, 1159 based on Foata normal form. 2/5635 useless extension candidates. Maximal degree in co-relation 24976. Up to 4987 conditions per place. [2024-05-12 11:30:11,237 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 153 selfloop transitions, 13 changer transitions 0/182 dead transitions. [2024-05-12 11:30:11,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 182 transitions, 1856 flow [2024-05-12 11:30:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:30:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:30:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-05-12 11:30:11,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-05-12 11:30:11,238 INFO L175 Difference]: Start difference. First operand has 127 places, 154 transitions, 1398 flow. Second operand 6 states and 147 transitions. [2024-05-12 11:30:11,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 182 transitions, 1856 flow [2024-05-12 11:30:11,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 182 transitions, 1794 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 11:30:11,286 INFO L231 Difference]: Finished difference. Result has 129 places, 161 transitions, 1456 flow [2024-05-12 11:30:11,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1456, PETRI_PLACES=129, PETRI_TRANSITIONS=161} [2024-05-12 11:30:11,287 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 75 predicate places. [2024-05-12 11:30:11,287 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 161 transitions, 1456 flow [2024-05-12 11:30:11,287 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:30:11,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:30:11,288 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:30:11,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:30:11,288 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:30:11,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:30:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1246610198, now seen corresponding path program 2 times [2024-05-12 11:30:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:30:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103120927] [2024-05-12 11:30:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:30:11,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:30:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:30:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103120927] [2024-05-12 11:30:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103120927] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:21,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:30:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967716137] [2024-05-12 11:30:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:21,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:30:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:30:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:30:21,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:30:21,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 161 transitions, 1456 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:30:21,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:21,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:30:21,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:23,437 INFO L124 PetriNetUnfolderBase]: 3474/6127 cut-off events. [2024-05-12 11:30:23,437 INFO L125 PetriNetUnfolderBase]: For 59055/59061 co-relation queries the response was YES. [2024-05-12 11:30:23,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26381 conditions, 6127 events. 3474/6127 cut-off events. For 59055/59061 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 42181 event pairs, 1173 based on Foata normal form. 6/5929 useless extension candidates. Maximal degree in co-relation 26324. Up to 4997 conditions per place. [2024-05-12 11:30:23,477 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 151 selfloop transitions, 18 changer transitions 0/185 dead transitions. [2024-05-12 11:30:23,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 185 transitions, 1895 flow [2024-05-12 11:30:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:30:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:30:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-05-12 11:30:23,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-05-12 11:30:23,479 INFO L175 Difference]: Start difference. First operand has 129 places, 161 transitions, 1456 flow. Second operand 6 states and 148 transitions. [2024-05-12 11:30:23,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 185 transitions, 1895 flow [2024-05-12 11:30:23,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 185 transitions, 1850 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 11:30:23,528 INFO L231 Difference]: Finished difference. Result has 132 places, 164 transitions, 1495 flow [2024-05-12 11:30:23,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=132, PETRI_TRANSITIONS=164} [2024-05-12 11:30:23,528 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 78 predicate places. [2024-05-12 11:30:23,529 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 164 transitions, 1495 flow [2024-05-12 11:30:23,529 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:30:23,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:30:23,529 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:30:23,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:30:23,529 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:30:23,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:30:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2050171872, now seen corresponding path program 1 times [2024-05-12 11:30:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:30:23,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697508222] [2024-05-12 11:30:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:30:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:30:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:30:33,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:33,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697508222] [2024-05-12 11:30:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697508222] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:33,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:30:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093223765] [2024-05-12 11:30:33,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:33,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:30:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:33,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:30:33,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:30:33,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:30:33,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 164 transitions, 1495 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:30:33,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:33,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:30:33,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:35,569 INFO L124 PetriNetUnfolderBase]: 4267/6992 cut-off events. [2024-05-12 11:30:35,569 INFO L125 PetriNetUnfolderBase]: For 81889/81895 co-relation queries the response was YES. [2024-05-12 11:30:35,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32182 conditions, 6992 events. 4267/6992 cut-off events. For 81889/81895 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 45822 event pairs, 1313 based on Foata normal form. 13/6832 useless extension candidates. Maximal degree in co-relation 32124. Up to 5382 conditions per place. [2024-05-12 11:30:35,623 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 146 selfloop transitions, 73 changer transitions 0/234 dead transitions. [2024-05-12 11:30:35,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 234 transitions, 2236 flow [2024-05-12 11:30:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:30:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:30:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-05-12 11:30:35,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393518518518519 [2024-05-12 11:30:35,624 INFO L175 Difference]: Start difference. First operand has 132 places, 164 transitions, 1495 flow. Second operand 9 states and 233 transitions. [2024-05-12 11:30:35,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 234 transitions, 2236 flow [2024-05-12 11:30:35,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 234 transitions, 2174 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-05-12 11:30:35,695 INFO L231 Difference]: Finished difference. Result has 139 places, 172 transitions, 1709 flow [2024-05-12 11:30:35,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1709, PETRI_PLACES=139, PETRI_TRANSITIONS=172} [2024-05-12 11:30:35,696 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 85 predicate places. [2024-05-12 11:30:35,696 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 172 transitions, 1709 flow [2024-05-12 11:30:35,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:30:35,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:30:35,697 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:30:35,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:30:35,697 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:30:35,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:30:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash 830068193, now seen corresponding path program 1 times [2024-05-12 11:30:35,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:30:35,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781603129] [2024-05-12 11:30:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:30:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:30:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:45,671 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:30:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:45,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781603129] [2024-05-12 11:30:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781603129] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:45,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:30:45,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505170845] [2024-05-12 11:30:45,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:45,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:30:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:45,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:30:45,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:30:45,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:30:45,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 172 transitions, 1709 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:30:45,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:45,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:30:45,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:30:47,846 INFO L124 PetriNetUnfolderBase]: 3917/6599 cut-off events. [2024-05-12 11:30:47,846 INFO L125 PetriNetUnfolderBase]: For 86655/86668 co-relation queries the response was YES. [2024-05-12 11:30:47,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31504 conditions, 6599 events. 3917/6599 cut-off events. For 86655/86668 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 44874 event pairs, 1366 based on Foata normal form. 15/6427 useless extension candidates. Maximal degree in co-relation 31443. Up to 5630 conditions per place. [2024-05-12 11:30:47,902 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 150 selfloop transitions, 18 changer transitions 0/203 dead transitions. [2024-05-12 11:30:47,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 203 transitions, 2156 flow [2024-05-12 11:30:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:30:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:30:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-05-12 11:30:47,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2024-05-12 11:30:47,905 INFO L175 Difference]: Start difference. First operand has 139 places, 172 transitions, 1709 flow. Second operand 7 states and 171 transitions. [2024-05-12 11:30:47,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 203 transitions, 2156 flow [2024-05-12 11:30:47,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 203 transitions, 1993 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 11:30:47,973 INFO L231 Difference]: Finished difference. Result has 140 places, 175 transitions, 1624 flow [2024-05-12 11:30:47,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1624, PETRI_PLACES=140, PETRI_TRANSITIONS=175} [2024-05-12 11:30:47,974 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 86 predicate places. [2024-05-12 11:30:47,974 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 175 transitions, 1624 flow [2024-05-12 11:30:47,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:30:47,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:30:47,975 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:30:47,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:30:47,975 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:30:47,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:30:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash 305663742, now seen corresponding path program 2 times [2024-05-12 11:30:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:30:47,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026921551] [2024-05-12 11:30:47,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:30:47,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:30:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:30:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:30:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:30:57,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026921551] [2024-05-12 11:30:57,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026921551] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:30:57,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:30:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:30:57,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260562162] [2024-05-12 11:30:57,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:30:57,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:30:57,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:30:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:30:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:30:57,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:30:57,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 175 transitions, 1624 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:30:57,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:30:57,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:30:57,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:31:00,005 INFO L124 PetriNetUnfolderBase]: 4575/7495 cut-off events. [2024-05-12 11:31:00,006 INFO L125 PetriNetUnfolderBase]: For 96498/96502 co-relation queries the response was YES. [2024-05-12 11:31:00,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35834 conditions, 7495 events. 4575/7495 cut-off events. For 96498/96502 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 49740 event pairs, 1416 based on Foata normal form. 16/7339 useless extension candidates. Maximal degree in co-relation 35774. Up to 6025 conditions per place. [2024-05-12 11:31:00,058 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 152 selfloop transitions, 71 changer transitions 0/238 dead transitions. [2024-05-12 11:31:00,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 238 transitions, 2337 flow [2024-05-12 11:31:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:31:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:31:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-05-12 11:31:00,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-05-12 11:31:00,060 INFO L175 Difference]: Start difference. First operand has 140 places, 175 transitions, 1624 flow. Second operand 9 states and 231 transitions. [2024-05-12 11:31:00,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 238 transitions, 2337 flow [2024-05-12 11:31:00,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 238 transitions, 2281 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-05-12 11:31:00,123 INFO L231 Difference]: Finished difference. Result has 146 places, 181 transitions, 1816 flow [2024-05-12 11:31:00,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1816, PETRI_PLACES=146, PETRI_TRANSITIONS=181} [2024-05-12 11:31:00,124 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 92 predicate places. [2024-05-12 11:31:00,124 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 181 transitions, 1816 flow [2024-05-12 11:31:00,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:31:00,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:31:00,124 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:31:00,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:31:00,125 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:31:00,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:31:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash -962834690, now seen corresponding path program 3 times [2024-05-12 11:31:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:31:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195553603] [2024-05-12 11:31:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:31:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:31:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:31:10,162 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:31:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:31:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195553603] [2024-05-12 11:31:10,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195553603] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:31:10,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:31:10,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:31:10,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817292265] [2024-05-12 11:31:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:31:10,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:31:10,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:31:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:31:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:31:10,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:31:10,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 181 transitions, 1816 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:31:10,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:31:10,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:31:10,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:31:12,837 INFO L124 PetriNetUnfolderBase]: 4640/7686 cut-off events. [2024-05-12 11:31:12,837 INFO L125 PetriNetUnfolderBase]: For 108955/108955 co-relation queries the response was YES. [2024-05-12 11:31:12,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37953 conditions, 7686 events. 4640/7686 cut-off events. For 108955/108955 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 52078 event pairs, 1446 based on Foata normal form. 12/7514 useless extension candidates. Maximal degree in co-relation 37890. Up to 6162 conditions per place. [2024-05-12 11:31:12,894 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 152 selfloop transitions, 75 changer transitions 0/242 dead transitions. [2024-05-12 11:31:12,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 242 transitions, 2534 flow [2024-05-12 11:31:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:31:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:31:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-05-12 11:31:12,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2024-05-12 11:31:12,895 INFO L175 Difference]: Start difference. First operand has 146 places, 181 transitions, 1816 flow. Second operand 9 states and 230 transitions. [2024-05-12 11:31:12,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 242 transitions, 2534 flow [2024-05-12 11:31:13,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 242 transitions, 2398 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 11:31:13,014 INFO L231 Difference]: Finished difference. Result has 152 places, 185 transitions, 1915 flow [2024-05-12 11:31:13,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1915, PETRI_PLACES=152, PETRI_TRANSITIONS=185} [2024-05-12 11:31:13,015 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 98 predicate places. [2024-05-12 11:31:13,015 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 185 transitions, 1915 flow [2024-05-12 11:31:13,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:31:13,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:31:13,015 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:31:13,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:31:13,016 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:31:13,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:31:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2114417790, now seen corresponding path program 4 times [2024-05-12 11:31:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:31:13,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855971007] [2024-05-12 11:31:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:31:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:31:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:31:21,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:31:21,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:31:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855971007] [2024-05-12 11:31:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855971007] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:31:21,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:31:21,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:31:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958396684] [2024-05-12 11:31:21,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:31:21,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:31:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:31:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:31:21,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:31:22,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:31:22,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 185 transitions, 1915 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:31:22,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:31:22,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:31:22,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:31:24,399 INFO L124 PetriNetUnfolderBase]: 4696/7632 cut-off events. [2024-05-12 11:31:24,399 INFO L125 PetriNetUnfolderBase]: For 108792/108792 co-relation queries the response was YES. [2024-05-12 11:31:24,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37805 conditions, 7632 events. 4696/7632 cut-off events. For 108792/108792 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 50235 event pairs, 1259 based on Foata normal form. 12/7479 useless extension candidates. Maximal degree in co-relation 37740. Up to 5178 conditions per place. [2024-05-12 11:31:24,455 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 142 selfloop transitions, 85 changer transitions 0/242 dead transitions. [2024-05-12 11:31:24,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 242 transitions, 2523 flow [2024-05-12 11:31:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:31:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:31:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions. [2024-05-12 11:31:24,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5300925925925926 [2024-05-12 11:31:24,457 INFO L175 Difference]: Start difference. First operand has 152 places, 185 transitions, 1915 flow. Second operand 9 states and 229 transitions. [2024-05-12 11:31:24,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 242 transitions, 2523 flow [2024-05-12 11:31:24,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 242 transitions, 2390 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-05-12 11:31:24,572 INFO L231 Difference]: Finished difference. Result has 156 places, 184 transitions, 1912 flow [2024-05-12 11:31:24,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1912, PETRI_PLACES=156, PETRI_TRANSITIONS=184} [2024-05-12 11:31:24,573 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 102 predicate places. [2024-05-12 11:31:24,573 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 184 transitions, 1912 flow [2024-05-12 11:31:24,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:31:24,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:31:24,573 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:31:24,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:31:24,573 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 11:31:24,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:31:24,574 INFO L85 PathProgramCache]: Analyzing trace with hash -9527397, now seen corresponding path program 2 times [2024-05-12 11:31:24,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:31:24,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441231393] [2024-05-12 11:31:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:31:24,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:31:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:31:36,359 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:31:36,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:31:36,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441231393] [2024-05-12 11:31:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441231393] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:31:36,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:31:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:31:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571034754] [2024-05-12 11:31:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:31:36,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:31:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:31:36,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:31:36,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:31:36,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:31:36,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 184 transitions, 1912 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:31:36,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:31:36,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:31:36,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:31:38,612 INFO L124 PetriNetUnfolderBase]: 4898/8243 cut-off events. [2024-05-12 11:31:38,612 INFO L125 PetriNetUnfolderBase]: For 115355/115391 co-relation queries the response was YES. [2024-05-12 11:31:38,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39834 conditions, 8243 events. 4898/8243 cut-off events. For 115355/115391 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 57253 event pairs, 1796 based on Foata normal form. 32/7955 useless extension candidates. Maximal degree in co-relation 39768. Up to 7061 conditions per place. [2024-05-12 11:31:38,681 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 167 selfloop transitions, 33 changer transitions 0/229 dead transitions. [2024-05-12 11:31:38,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 229 transitions, 2586 flow [2024-05-12 11:31:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:31:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:31:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-05-12 11:31:38,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2024-05-12 11:31:38,682 INFO L175 Difference]: Start difference. First operand has 156 places, 184 transitions, 1912 flow. Second operand 7 states and 163 transitions. [2024-05-12 11:31:38,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 229 transitions, 2586 flow [2024-05-12 11:31:38,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 229 transitions, 2370 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 11:31:38,782 INFO L231 Difference]: Finished difference. Result has 157 places, 206 transitions, 1969 flow [2024-05-12 11:31:38,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1969, PETRI_PLACES=157, PETRI_TRANSITIONS=206} [2024-05-12 11:31:38,783 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 103 predicate places. [2024-05-12 11:31:38,783 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 206 transitions, 1969 flow [2024-05-12 11:31:38,783 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:31:38,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:31:38,784 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:31:38,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:31:38,784 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 11:31:38,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:31:38,784 INFO L85 PathProgramCache]: Analyzing trace with hash 842955203, now seen corresponding path program 3 times [2024-05-12 11:31:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:31:38,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844957974] [2024-05-12 11:31:38,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:31:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:31:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:31:50,292 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:31:50,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:31:50,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844957974] [2024-05-12 11:31:50,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844957974] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:31:50,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:31:50,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:31:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644763142] [2024-05-12 11:31:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:31:50,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:31:50,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:31:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:31:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:31:50,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:31:50,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 206 transitions, 1969 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 11:31:50,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:31:50,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:31:50,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:31:52,500 INFO L124 PetriNetUnfolderBase]: 4415/7725 cut-off events. [2024-05-12 11:31:52,500 INFO L125 PetriNetUnfolderBase]: For 108527/108589 co-relation queries the response was YES. [2024-05-12 11:31:52,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36926 conditions, 7725 events. 4415/7725 cut-off events. For 108527/108589 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 55770 event pairs, 1484 based on Foata normal form. 42/7428 useless extension candidates. Maximal degree in co-relation 36858. Up to 6334 conditions per place. [2024-05-12 11:31:52,572 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 162 selfloop transitions, 34 changer transitions 0/234 dead transitions. [2024-05-12 11:31:52,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 234 transitions, 2482 flow [2024-05-12 11:31:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:31:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:31:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-05-12 11:31:52,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2024-05-12 11:31:52,574 INFO L175 Difference]: Start difference. First operand has 157 places, 206 transitions, 1969 flow. Second operand 7 states and 167 transitions. [2024-05-12 11:31:52,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 234 transitions, 2482 flow [2024-05-12 11:31:52,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 234 transitions, 2412 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-05-12 11:31:52,659 INFO L231 Difference]: Finished difference. Result has 162 places, 210 transitions, 2034 flow [2024-05-12 11:31:52,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2034, PETRI_PLACES=162, PETRI_TRANSITIONS=210} [2024-05-12 11:31:52,660 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 108 predicate places. [2024-05-12 11:31:52,660 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 210 transitions, 2034 flow [2024-05-12 11:31:52,660 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 11:31:52,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:31:52,660 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:31:52,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 11:31:52,660 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 11:31:52,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:31:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash 309663030, now seen corresponding path program 1 times [2024-05-12 11:31:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:31:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972164237] [2024-05-12 11:31:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:31:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:31:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:32:02,914 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:32:02,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:32:02,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972164237] [2024-05-12 11:32:02,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972164237] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:32:02,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:32:02,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:32:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150912763] [2024-05-12 11:32:02,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:32:02,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:32:02,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:32:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:32:02,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:32:03,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:32:03,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 210 transitions, 2034 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 11:32:03,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:32:03,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:32:03,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:32:05,261 INFO L124 PetriNetUnfolderBase]: 4702/7924 cut-off events. [2024-05-12 11:32:05,262 INFO L125 PetriNetUnfolderBase]: For 117953/118008 co-relation queries the response was YES. [2024-05-12 11:32:05,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39450 conditions, 7924 events. 4702/7924 cut-off events. For 117953/118008 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 55085 event pairs, 1519 based on Foata normal form. 4/7652 useless extension candidates. Maximal degree in co-relation 39380. Up to 6708 conditions per place. [2024-05-12 11:32:05,328 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 201 selfloop transitions, 17 changer transitions 0/243 dead transitions. [2024-05-12 11:32:05,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 243 transitions, 2628 flow [2024-05-12 11:32:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:32:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:32:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-05-12 11:32:05,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029761904761905 [2024-05-12 11:32:05,330 INFO L175 Difference]: Start difference. First operand has 162 places, 210 transitions, 2034 flow. Second operand 7 states and 169 transitions. [2024-05-12 11:32:05,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 243 transitions, 2628 flow [2024-05-12 11:32:05,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 243 transitions, 2530 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-05-12 11:32:05,479 INFO L231 Difference]: Finished difference. Result has 165 places, 217 transitions, 2084 flow [2024-05-12 11:32:05,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1936, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2084, PETRI_PLACES=165, PETRI_TRANSITIONS=217} [2024-05-12 11:32:05,480 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 111 predicate places. [2024-05-12 11:32:05,480 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 217 transitions, 2084 flow [2024-05-12 11:32:05,480 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 11:32:05,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:32:05,480 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:32:05,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 11:32:05,481 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 11:32:05,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:32:05,481 INFO L85 PathProgramCache]: Analyzing trace with hash -187842435, now seen corresponding path program 1 times [2024-05-12 11:32:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:32:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100297784] [2024-05-12 11:32:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:32:05,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:32:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:32:16,523 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:32:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:32:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100297784] [2024-05-12 11:32:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100297784] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:32:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:32:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:32:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076582267] [2024-05-12 11:32:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:32:16,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:32:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:32:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:32:16,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:32:16,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:32:16,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 217 transitions, 2084 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 11:32:16,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:32:16,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:32:16,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:32:18,846 INFO L124 PetriNetUnfolderBase]: 4723/7960 cut-off events. [2024-05-12 11:32:18,847 INFO L125 PetriNetUnfolderBase]: For 127678/127733 co-relation queries the response was YES. [2024-05-12 11:32:18,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40602 conditions, 7960 events. 4723/7960 cut-off events. For 127678/127733 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 55357 event pairs, 1513 based on Foata normal form. 7/7693 useless extension candidates. Maximal degree in co-relation 40530. Up to 6710 conditions per place. [2024-05-12 11:32:18,917 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 205 selfloop transitions, 17 changer transitions 0/247 dead transitions. [2024-05-12 11:32:18,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 247 transitions, 2655 flow [2024-05-12 11:32:18,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:32:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:32:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-05-12 11:32:18,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029761904761905 [2024-05-12 11:32:18,919 INFO L175 Difference]: Start difference. First operand has 165 places, 217 transitions, 2084 flow. Second operand 7 states and 169 transitions. [2024-05-12 11:32:18,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 247 transitions, 2655 flow [2024-05-12 11:32:19,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 247 transitions, 2588 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-05-12 11:32:19,043 INFO L231 Difference]: Finished difference. Result has 168 places, 221 transitions, 2110 flow [2024-05-12 11:32:19,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2017, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2110, PETRI_PLACES=168, PETRI_TRANSITIONS=221} [2024-05-12 11:32:19,043 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 114 predicate places. [2024-05-12 11:32:19,043 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 221 transitions, 2110 flow [2024-05-12 11:32:19,043 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 11:32:19,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:32:19,044 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:32:19,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 11:32:19,044 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 11:32:19,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:32:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -9521445, now seen corresponding path program 2 times [2024-05-12 11:32:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:32:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34890782] [2024-05-12 11:32:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:32:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:32:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:32:30,271 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:32:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:32:30,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34890782] [2024-05-12 11:32:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34890782] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:32:30,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:32:30,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:32:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514518242] [2024-05-12 11:32:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:32:30,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:32:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:32:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:32:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:32:30,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:32:30,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 221 transitions, 2110 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 11:32:30,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:32:30,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:32:30,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:32:32,713 INFO L124 PetriNetUnfolderBase]: 4673/8173 cut-off events. [2024-05-12 11:32:32,714 INFO L125 PetriNetUnfolderBase]: For 136577/136649 co-relation queries the response was YES. [2024-05-12 11:32:32,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42041 conditions, 8173 events. 4673/8173 cut-off events. For 136577/136649 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 59167 event pairs, 1448 based on Foata normal form. 11/7879 useless extension candidates. Maximal degree in co-relation 41968. Up to 6541 conditions per place. [2024-05-12 11:32:32,790 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 198 selfloop transitions, 33 changer transitions 0/256 dead transitions. [2024-05-12 11:32:32,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 256 transitions, 2827 flow [2024-05-12 11:32:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:32:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:32:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-05-12 11:32:32,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2024-05-12 11:32:32,791 INFO L175 Difference]: Start difference. First operand has 168 places, 221 transitions, 2110 flow. Second operand 7 states and 171 transitions. [2024-05-12 11:32:32,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 256 transitions, 2827 flow [2024-05-12 11:32:32,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 256 transitions, 2762 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-05-12 11:32:32,919 INFO L231 Difference]: Finished difference. Result has 171 places, 230 transitions, 2246 flow [2024-05-12 11:32:32,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2045, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2246, PETRI_PLACES=171, PETRI_TRANSITIONS=230} [2024-05-12 11:32:32,920 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 117 predicate places. [2024-05-12 11:32:32,920 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 230 transitions, 2246 flow [2024-05-12 11:32:32,920 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 11:32:32,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:32:32,920 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:32:32,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 11:32:32,920 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 11:32:32,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:32:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash -9788355, now seen corresponding path program 3 times [2024-05-12 11:32:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:32:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034015942] [2024-05-12 11:32:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:32:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:32:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:32:44,185 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:32:44,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:32:44,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034015942] [2024-05-12 11:32:44,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034015942] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:32:44,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:32:44,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:32:44,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844665332] [2024-05-12 11:32:44,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:32:44,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:32:44,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:32:44,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:32:44,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:32:44,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:32:44,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 230 transitions, 2246 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 11:32:44,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:32:44,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:32:44,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:32:46,471 INFO L124 PetriNetUnfolderBase]: 4682/8152 cut-off events. [2024-05-12 11:32:46,471 INFO L125 PetriNetUnfolderBase]: For 146848/146904 co-relation queries the response was YES. [2024-05-12 11:32:46,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43456 conditions, 8152 events. 4682/8152 cut-off events. For 146848/146904 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 58746 event pairs, 1446 based on Foata normal form. 13/7855 useless extension candidates. Maximal degree in co-relation 43381. Up to 6612 conditions per place. [2024-05-12 11:32:46,564 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 208 selfloop transitions, 24 changer transitions 0/257 dead transitions. [2024-05-12 11:32:46,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 257 transitions, 2824 flow [2024-05-12 11:32:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:32:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:32:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-05-12 11:32:46,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2024-05-12 11:32:46,566 INFO L175 Difference]: Start difference. First operand has 171 places, 230 transitions, 2246 flow. Second operand 7 states and 170 transitions. [2024-05-12 11:32:46,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 257 transitions, 2824 flow [2024-05-12 11:32:46,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 257 transitions, 2741 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-05-12 11:32:46,708 INFO L231 Difference]: Finished difference. Result has 175 places, 231 transitions, 2227 flow [2024-05-12 11:32:46,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2227, PETRI_PLACES=175, PETRI_TRANSITIONS=231} [2024-05-12 11:32:46,708 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 121 predicate places. [2024-05-12 11:32:46,709 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 231 transitions, 2227 flow [2024-05-12 11:32:46,709 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 11:32:46,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:32:46,709 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 11:32:46,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 11:32:46,709 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 11:32:46,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:32:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1647574121, now seen corresponding path program 1 times [2024-05-12 11:32:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:32:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496493679] [2024-05-12 11:32:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:32:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:32:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:32:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:32:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:32:57,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496493679] [2024-05-12 11:32:57,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496493679] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:32:57,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:32:57,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:32:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682112727] [2024-05-12 11:32:57,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:32:57,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:32:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:32:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:32:57,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:32:57,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:32:57,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 231 transitions, 2227 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:32:57,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:32:57,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:32:57,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:00,107 INFO L124 PetriNetUnfolderBase]: 5117/8474 cut-off events. [2024-05-12 11:33:00,107 INFO L125 PetriNetUnfolderBase]: For 152865/152898 co-relation queries the response was YES. [2024-05-12 11:33:00,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45838 conditions, 8474 events. 5117/8474 cut-off events. For 152865/152898 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 58138 event pairs, 1631 based on Foata normal form. 8/8203 useless extension candidates. Maximal degree in co-relation 45761. Up to 7347 conditions per place. [2024-05-12 11:33:00,176 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 230 selfloop transitions, 25 changer transitions 0/273 dead transitions. [2024-05-12 11:33:00,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 273 transitions, 2986 flow [2024-05-12 11:33:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:33:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:33:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-05-12 11:33:00,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029761904761905 [2024-05-12 11:33:00,178 INFO L175 Difference]: Start difference. First operand has 175 places, 231 transitions, 2227 flow. Second operand 7 states and 169 transitions. [2024-05-12 11:33:00,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 273 transitions, 2986 flow [2024-05-12 11:33:00,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 273 transitions, 2933 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-05-12 11:33:00,305 INFO L231 Difference]: Finished difference. Result has 179 places, 244 transitions, 2430 flow [2024-05-12 11:33:00,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2430, PETRI_PLACES=179, PETRI_TRANSITIONS=244} [2024-05-12 11:33:00,306 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 125 predicate places. [2024-05-12 11:33:00,306 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 244 transitions, 2430 flow [2024-05-12 11:33:00,306 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:33:00,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:00,306 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 11:33:00,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 11:33:00,307 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 11:33:00,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1559388665, now seen corresponding path program 2 times [2024-05-12 11:33:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:00,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63418525] [2024-05-12 11:33:00,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:10,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 11:33:10,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:10,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63418525] [2024-05-12 11:33:10,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63418525] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:10,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:10,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:33:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511981659] [2024-05-12 11:33:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:10,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:33:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:33:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:33:10,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:33:10,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 244 transitions, 2430 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:33:10,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:10,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:33:10,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:13,059 INFO L124 PetriNetUnfolderBase]: 5191/8600 cut-off events. [2024-05-12 11:33:13,059 INFO L125 PetriNetUnfolderBase]: For 168125/168158 co-relation queries the response was YES. [2024-05-12 11:33:13,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48125 conditions, 8600 events. 5191/8600 cut-off events. For 168125/168158 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 59272 event pairs, 1635 based on Foata normal form. 8/8325 useless extension candidates. Maximal degree in co-relation 48045. Up to 7392 conditions per place. [2024-05-12 11:33:13,148 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 232 selfloop transitions, 34 changer transitions 0/284 dead transitions. [2024-05-12 11:33:13,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 284 transitions, 3284 flow [2024-05-12 11:33:13,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:33:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:33:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-05-12 11:33:13,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2024-05-12 11:33:13,149 INFO L175 Difference]: Start difference. First operand has 179 places, 244 transitions, 2430 flow. Second operand 7 states and 170 transitions. [2024-05-12 11:33:13,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 284 transitions, 3284 flow [2024-05-12 11:33:13,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 284 transitions, 3206 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-05-12 11:33:13,360 INFO L231 Difference]: Finished difference. Result has 184 places, 254 transitions, 2585 flow [2024-05-12 11:33:13,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2585, PETRI_PLACES=184, PETRI_TRANSITIONS=254} [2024-05-12 11:33:13,360 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 130 predicate places. [2024-05-12 11:33:13,360 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 254 transitions, 2585 flow [2024-05-12 11:33:13,360 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:33:13,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:13,361 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 11:33:13,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 11:33:13,361 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 11:33:13,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1564990613, now seen corresponding path program 1 times [2024-05-12 11:33:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:13,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463914995] [2024-05-12 11:33:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:25,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:25,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463914995] [2024-05-12 11:33:25,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463914995] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:25,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:25,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:33:25,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255744232] [2024-05-12 11:33:25,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:25,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:33:25,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:25,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:33:25,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:33:25,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:33:25,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 254 transitions, 2585 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:33:25,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:25,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:33:25,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:27,896 INFO L124 PetriNetUnfolderBase]: 4867/8197 cut-off events. [2024-05-12 11:33:27,897 INFO L125 PetriNetUnfolderBase]: For 176890/176942 co-relation queries the response was YES. [2024-05-12 11:33:27,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46955 conditions, 8197 events. 4867/8197 cut-off events. For 176890/176942 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 57573 event pairs, 1566 based on Foata normal form. 14/7884 useless extension candidates. Maximal degree in co-relation 46873. Up to 6875 conditions per place. [2024-05-12 11:33:27,988 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 215 selfloop transitions, 32 changer transitions 0/291 dead transitions. [2024-05-12 11:33:27,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 291 transitions, 3244 flow [2024-05-12 11:33:27,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:33:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:33:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 11:33:27,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2024-05-12 11:33:27,989 INFO L175 Difference]: Start difference. First operand has 184 places, 254 transitions, 2585 flow. Second operand 8 states and 193 transitions. [2024-05-12 11:33:27,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 291 transitions, 3244 flow [2024-05-12 11:33:28,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 291 transitions, 3172 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-05-12 11:33:28,187 INFO L231 Difference]: Finished difference. Result has 189 places, 257 transitions, 2634 flow [2024-05-12 11:33:28,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2513, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2634, PETRI_PLACES=189, PETRI_TRANSITIONS=257} [2024-05-12 11:33:28,188 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 135 predicate places. [2024-05-12 11:33:28,188 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 257 transitions, 2634 flow [2024-05-12 11:33:28,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:33:28,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:28,189 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 11:33:28,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 11:33:28,189 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 11:33:28,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:28,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1358592779, now seen corresponding path program 3 times [2024-05-12 11:33:28,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:28,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229588966] [2024-05-12 11:33:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:33:38,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:38,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229588966] [2024-05-12 11:33:38,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229588966] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:38,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:33:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935947715] [2024-05-12 11:33:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:38,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:33:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:33:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:33:38,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:33:38,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 257 transitions, 2634 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:33:38,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:38,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:33:38,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:41,500 INFO L124 PetriNetUnfolderBase]: 5259/8691 cut-off events. [2024-05-12 11:33:41,501 INFO L125 PetriNetUnfolderBase]: For 187096/187134 co-relation queries the response was YES. [2024-05-12 11:33:41,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50577 conditions, 8691 events. 5259/8691 cut-off events. For 187096/187134 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 59807 event pairs, 1647 based on Foata normal form. 2/8408 useless extension candidates. Maximal degree in co-relation 50493. Up to 7537 conditions per place. [2024-05-12 11:33:41,588 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 255 selfloop transitions, 26 changer transitions 0/299 dead transitions. [2024-05-12 11:33:41,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 299 transitions, 3330 flow [2024-05-12 11:33:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:33:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:33:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-05-12 11:33:41,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-05-12 11:33:41,589 INFO L175 Difference]: Start difference. First operand has 189 places, 257 transitions, 2634 flow. Second operand 9 states and 213 transitions. [2024-05-12 11:33:41,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 299 transitions, 3330 flow [2024-05-12 11:33:41,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 299 transitions, 3209 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-05-12 11:33:41,792 INFO L231 Difference]: Finished difference. Result has 192 places, 258 transitions, 2584 flow [2024-05-12 11:33:41,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2517, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2584, PETRI_PLACES=192, PETRI_TRANSITIONS=258} [2024-05-12 11:33:41,793 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 138 predicate places. [2024-05-12 11:33:41,793 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 258 transitions, 2584 flow [2024-05-12 11:33:41,793 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:33:41,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:41,794 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 11:33:41,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 11:33:41,794 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 11:33:41,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash 134260747, now seen corresponding path program 4 times [2024-05-12 11:33:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161208175] [2024-05-12 11:33:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:33:52,721 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:33:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:33:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161208175] [2024-05-12 11:33:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161208175] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:33:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:33:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:33:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292283058] [2024-05-12 11:33:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:33:52,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:33:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:33:52,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:33:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:33:52,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:33:52,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 258 transitions, 2584 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:33:52,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:33:52,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:33:52,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:33:55,469 INFO L124 PetriNetUnfolderBase]: 5293/8740 cut-off events. [2024-05-12 11:33:55,469 INFO L125 PetriNetUnfolderBase]: For 191211/191251 co-relation queries the response was YES. [2024-05-12 11:33:55,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50606 conditions, 8740 events. 5293/8740 cut-off events. For 191211/191251 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 60059 event pairs, 1649 based on Foata normal form. 6/8459 useless extension candidates. Maximal degree in co-relation 50521. Up to 7515 conditions per place. [2024-05-12 11:33:55,551 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 236 selfloop transitions, 33 changer transitions 0/287 dead transitions. [2024-05-12 11:33:55,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 287 transitions, 3284 flow [2024-05-12 11:33:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:33:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:33:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-05-12 11:33:55,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2024-05-12 11:33:55,553 INFO L175 Difference]: Start difference. First operand has 192 places, 258 transitions, 2584 flow. Second operand 7 states and 166 transitions. [2024-05-12 11:33:55,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 287 transitions, 3284 flow [2024-05-12 11:33:55,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 287 transitions, 3226 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 11:33:55,737 INFO L231 Difference]: Finished difference. Result has 193 places, 261 transitions, 2660 flow [2024-05-12 11:33:55,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2660, PETRI_PLACES=193, PETRI_TRANSITIONS=261} [2024-05-12 11:33:55,738 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 139 predicate places. [2024-05-12 11:33:55,738 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 261 transitions, 2660 flow [2024-05-12 11:33:55,738 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:33:55,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:33:55,738 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 11:33:55,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 11:33:55,739 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 11:33:55,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:33:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash -309166603, now seen corresponding path program 5 times [2024-05-12 11:33:55,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:33:55,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719136204] [2024-05-12 11:33:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:33:55,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:33:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:07,570 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:34:07,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719136204] [2024-05-12 11:34:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719136204] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:07,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:07,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715489205] [2024-05-12 11:34:07,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:07,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:07,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:07,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:07,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:34:07,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 261 transitions, 2660 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:34:07,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:07,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:34:07,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:10,233 INFO L124 PetriNetUnfolderBase]: 5230/8869 cut-off events. [2024-05-12 11:34:10,233 INFO L125 PetriNetUnfolderBase]: For 203451/203479 co-relation queries the response was YES. [2024-05-12 11:34:10,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51770 conditions, 8869 events. 5230/8869 cut-off events. For 203451/203479 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 62533 event pairs, 1537 based on Foata normal form. 13/8568 useless extension candidates. Maximal degree in co-relation 51684. Up to 7284 conditions per place. [2024-05-12 11:34:10,321 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 234 selfloop transitions, 55 changer transitions 0/307 dead transitions. [2024-05-12 11:34:10,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 307 transitions, 3628 flow [2024-05-12 11:34:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-05-12 11:34:10,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2024-05-12 11:34:10,322 INFO L175 Difference]: Start difference. First operand has 193 places, 261 transitions, 2660 flow. Second operand 8 states and 194 transitions. [2024-05-12 11:34:10,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 307 transitions, 3628 flow [2024-05-12 11:34:10,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 307 transitions, 3520 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-05-12 11:34:10,492 INFO L231 Difference]: Finished difference. Result has 197 places, 271 transitions, 2851 flow [2024-05-12 11:34:10,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2552, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2851, PETRI_PLACES=197, PETRI_TRANSITIONS=271} [2024-05-12 11:34:10,492 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 143 predicate places. [2024-05-12 11:34:10,492 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 271 transitions, 2851 flow [2024-05-12 11:34:10,492 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:34:10,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:10,493 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 11:34:10,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 11:34:10,493 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 11:34:10,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash -303452683, now seen corresponding path program 6 times [2024-05-12 11:34:10,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:10,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867374345] [2024-05-12 11:34:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:34:21,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:21,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867374345] [2024-05-12 11:34:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867374345] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:21,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:21,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778632752] [2024-05-12 11:34:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:21,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:21,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:21,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:21,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:34:21,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 271 transitions, 2851 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:34:21,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:21,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:34:21,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:24,443 INFO L124 PetriNetUnfolderBase]: 5227/8883 cut-off events. [2024-05-12 11:34:24,444 INFO L125 PetriNetUnfolderBase]: For 213724/213756 co-relation queries the response was YES. [2024-05-12 11:34:24,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52603 conditions, 8883 events. 5227/8883 cut-off events. For 213724/213756 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 62736 event pairs, 1546 based on Foata normal form. 16/8579 useless extension candidates. Maximal degree in co-relation 52515. Up to 7283 conditions per place. [2024-05-12 11:34:24,530 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 231 selfloop transitions, 58 changer transitions 0/307 dead transitions. [2024-05-12 11:34:24,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 307 transitions, 3601 flow [2024-05-12 11:34:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 11:34:24,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2024-05-12 11:34:24,532 INFO L175 Difference]: Start difference. First operand has 197 places, 271 transitions, 2851 flow. Second operand 8 states and 193 transitions. [2024-05-12 11:34:24,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 307 transitions, 3601 flow [2024-05-12 11:34:24,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 307 transitions, 3410 flow, removed 57 selfloop flow, removed 5 redundant places. [2024-05-12 11:34:24,740 INFO L231 Difference]: Finished difference. Result has 200 places, 272 transitions, 2801 flow [2024-05-12 11:34:24,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2672, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2801, PETRI_PLACES=200, PETRI_TRANSITIONS=272} [2024-05-12 11:34:24,740 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 146 predicate places. [2024-05-12 11:34:24,741 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 272 transitions, 2801 flow [2024-05-12 11:34:24,741 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:34:24,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:24,741 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 11:34:24,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 11:34:24,741 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 11:34:24,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash -294872875, now seen corresponding path program 2 times [2024-05-12 11:34:24,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:24,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966563182] [2024-05-12 11:34:24,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:36,704 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:34:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966563182] [2024-05-12 11:34:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966563182] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:36,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704940959] [2024-05-12 11:34:36,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:36,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:36,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:36,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:34:36,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 272 transitions, 2801 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:34:36,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:36,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:34:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:39,391 INFO L124 PetriNetUnfolderBase]: 4853/8526 cut-off events. [2024-05-12 11:34:39,391 INFO L125 PetriNetUnfolderBase]: For 208073/208123 co-relation queries the response was YES. [2024-05-12 11:34:39,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49300 conditions, 8526 events. 4853/8526 cut-off events. For 208073/208123 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 62582 event pairs, 1519 based on Foata normal form. 14/8184 useless extension candidates. Maximal degree in co-relation 49211. Up to 6863 conditions per place. [2024-05-12 11:34:39,483 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 234 selfloop transitions, 25 changer transitions 0/308 dead transitions. [2024-05-12 11:34:39,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 308 transitions, 3515 flow [2024-05-12 11:34:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-05-12 11:34:39,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921875 [2024-05-12 11:34:39,485 INFO L175 Difference]: Start difference. First operand has 200 places, 272 transitions, 2801 flow. Second operand 8 states and 189 transitions. [2024-05-12 11:34:39,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 308 transitions, 3515 flow [2024-05-12 11:34:39,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 308 transitions, 3425 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 11:34:39,678 INFO L231 Difference]: Finished difference. Result has 204 places, 278 transitions, 2861 flow [2024-05-12 11:34:39,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2861, PETRI_PLACES=204, PETRI_TRANSITIONS=278} [2024-05-12 11:34:39,679 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 150 predicate places. [2024-05-12 11:34:39,679 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 278 transitions, 2861 flow [2024-05-12 11:34:39,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:34:39,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:39,679 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 11:34:39,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 11:34:39,680 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 11:34:39,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash -309157675, now seen corresponding path program 3 times [2024-05-12 11:34:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113701092] [2024-05-12 11:34:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:34:50,901 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:34:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:34:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113701092] [2024-05-12 11:34:50,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113701092] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:34:50,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:34:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:34:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364378564] [2024-05-12 11:34:50,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:34:50,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:34:50,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:34:50,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:34:50,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:34:51,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:34:51,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 278 transitions, 2861 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:34:51,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:34:51,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:34:51,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:34:53,497 INFO L124 PetriNetUnfolderBase]: 4881/8466 cut-off events. [2024-05-12 11:34:53,497 INFO L125 PetriNetUnfolderBase]: For 218831/218916 co-relation queries the response was YES. [2024-05-12 11:34:53,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50387 conditions, 8466 events. 4881/8466 cut-off events. For 218831/218916 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 61507 event pairs, 1519 based on Foata normal form. 37/8127 useless extension candidates. Maximal degree in co-relation 50296. Up to 6878 conditions per place. [2024-05-12 11:34:53,580 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 215 selfloop transitions, 46 changer transitions 0/310 dead transitions. [2024-05-12 11:34:53,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 310 transitions, 3549 flow [2024-05-12 11:34:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:34:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:34:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-05-12 11:34:53,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921875 [2024-05-12 11:34:53,581 INFO L175 Difference]: Start difference. First operand has 204 places, 278 transitions, 2861 flow. Second operand 8 states and 189 transitions. [2024-05-12 11:34:53,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 310 transitions, 3549 flow [2024-05-12 11:34:53,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 310 transitions, 3452 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-05-12 11:34:53,786 INFO L231 Difference]: Finished difference. Result has 207 places, 281 transitions, 2923 flow [2024-05-12 11:34:53,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2764, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2923, PETRI_PLACES=207, PETRI_TRANSITIONS=281} [2024-05-12 11:34:53,786 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 153 predicate places. [2024-05-12 11:34:53,786 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 281 transitions, 2923 flow [2024-05-12 11:34:53,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:34:53,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:34:53,787 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 11:34:53,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 11:34:53,787 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 11:34:53,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:34:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -295348105, now seen corresponding path program 4 times [2024-05-12 11:34:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:34:53,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449915439] [2024-05-12 11:34:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:34:53,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:34:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:05,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 11:35:05,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:05,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449915439] [2024-05-12 11:35:05,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449915439] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:05,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:05,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:35:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970650696] [2024-05-12 11:35:05,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:05,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:35:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:05,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:35:05,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:35:05,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:35:05,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 281 transitions, 2923 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:35:05,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:05,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:35:05,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:08,305 INFO L124 PetriNetUnfolderBase]: 4937/8612 cut-off events. [2024-05-12 11:35:08,305 INFO L125 PetriNetUnfolderBase]: For 232045/232122 co-relation queries the response was YES. [2024-05-12 11:35:08,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51778 conditions, 8612 events. 4937/8612 cut-off events. For 232045/232122 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 63130 event pairs, 1515 based on Foata normal form. 28/8260 useless extension candidates. Maximal degree in co-relation 51686. Up to 6750 conditions per place. [2024-05-12 11:35:08,413 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 201 selfloop transitions, 73 changer transitions 0/323 dead transitions. [2024-05-12 11:35:08,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 323 transitions, 3879 flow [2024-05-12 11:35:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:35:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:35:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-05-12 11:35:08,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-05-12 11:35:08,415 INFO L175 Difference]: Start difference. First operand has 207 places, 281 transitions, 2923 flow. Second operand 8 states and 196 transitions. [2024-05-12 11:35:08,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 323 transitions, 3879 flow [2024-05-12 11:35:08,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 323 transitions, 3748 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-05-12 11:35:08,671 INFO L231 Difference]: Finished difference. Result has 210 places, 290 transitions, 3148 flow [2024-05-12 11:35:08,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2792, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3148, PETRI_PLACES=210, PETRI_TRANSITIONS=290} [2024-05-12 11:35:08,671 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 156 predicate places. [2024-05-12 11:35:08,672 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 290 transitions, 3148 flow [2024-05-12 11:35:08,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:35:08,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:08,672 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 11:35:08,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 11:35:08,672 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 11:35:08,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1531901645, now seen corresponding path program 1 times [2024-05-12 11:35:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:08,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432811786] [2024-05-12 11:35:08,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:21,239 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:35:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432811786] [2024-05-12 11:35:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432811786] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:21,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:21,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:35:21,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921484000] [2024-05-12 11:35:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:21,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:35:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:35:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:35:21,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:35:21,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 290 transitions, 3148 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:35:21,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:21,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:35:21,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:23,989 INFO L124 PetriNetUnfolderBase]: 5281/8852 cut-off events. [2024-05-12 11:35:23,989 INFO L125 PetriNetUnfolderBase]: For 251383/251495 co-relation queries the response was YES. [2024-05-12 11:35:24,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55894 conditions, 8852 events. 5281/8852 cut-off events. For 251383/251495 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 62394 event pairs, 1597 based on Foata normal form. 41/8570 useless extension candidates. Maximal degree in co-relation 55800. Up to 7441 conditions per place. [2024-05-12 11:35:24,083 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 278 selfloop transitions, 20 changer transitions 0/325 dead transitions. [2024-05-12 11:35:24,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 325 transitions, 3907 flow [2024-05-12 11:35:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:35:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:35:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-05-12 11:35:24,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:35:24,085 INFO L175 Difference]: Start difference. First operand has 210 places, 290 transitions, 3148 flow. Second operand 8 states and 192 transitions. [2024-05-12 11:35:24,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 325 transitions, 3907 flow [2024-05-12 11:35:24,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 325 transitions, 3777 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-05-12 11:35:24,389 INFO L231 Difference]: Finished difference. Result has 215 places, 293 transitions, 3128 flow [2024-05-12 11:35:24,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3018, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3128, PETRI_PLACES=215, PETRI_TRANSITIONS=293} [2024-05-12 11:35:24,389 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 161 predicate places. [2024-05-12 11:35:24,390 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 293 transitions, 3128 flow [2024-05-12 11:35:24,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:35:24,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:24,390 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 11:35:24,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 11:35:24,390 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 11:35:24,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1528147235, now seen corresponding path program 2 times [2024-05-12 11:35:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:24,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830764821] [2024-05-12 11:35:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:38,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 11:35:38,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:38,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830764821] [2024-05-12 11:35:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830764821] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:38,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:38,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:35:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925216653] [2024-05-12 11:35:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:38,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:35:38,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:38,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:35:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:35:38,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:35:38,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 293 transitions, 3128 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:35:38,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:38,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:35:38,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:40,912 INFO L124 PetriNetUnfolderBase]: 5361/8972 cut-off events. [2024-05-12 11:35:40,912 INFO L125 PetriNetUnfolderBase]: For 262672/262794 co-relation queries the response was YES. [2024-05-12 11:35:40,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57426 conditions, 8972 events. 5361/8972 cut-off events. For 262672/262794 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 63320 event pairs, 1587 based on Foata normal form. 62/8713 useless extension candidates. Maximal degree in co-relation 57330. Up to 7495 conditions per place. [2024-05-12 11:35:41,020 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 282 selfloop transitions, 24 changer transitions 0/333 dead transitions. [2024-05-12 11:35:41,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 333 transitions, 4103 flow [2024-05-12 11:35:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:35:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:35:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-05-12 11:35:41,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2024-05-12 11:35:41,021 INFO L175 Difference]: Start difference. First operand has 215 places, 293 transitions, 3128 flow. Second operand 8 states and 194 transitions. [2024-05-12 11:35:41,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 333 transitions, 4103 flow [2024-05-12 11:35:41,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 333 transitions, 4021 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-05-12 11:35:41,381 INFO L231 Difference]: Finished difference. Result has 218 places, 301 transitions, 3271 flow [2024-05-12 11:35:41,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3271, PETRI_PLACES=218, PETRI_TRANSITIONS=301} [2024-05-12 11:35:41,382 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 164 predicate places. [2024-05-12 11:35:41,382 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 301 transitions, 3271 flow [2024-05-12 11:35:41,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:35:41,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:41,382 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 11:35:41,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 11:35:41,383 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 11:35:41,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:41,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1154584259, now seen corresponding path program 3 times [2024-05-12 11:35:41,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:41,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467327116] [2024-05-12 11:35:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:41,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:35:55,977 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:35:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:35:55,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467327116] [2024-05-12 11:35:55,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467327116] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:35:55,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:35:55,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:35:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920279896] [2024-05-12 11:35:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:35:55,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:35:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:35:55,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:35:55,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:35:56,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:35:56,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 301 transitions, 3271 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:35:56,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:35:56,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:35:56,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:35:58,872 INFO L124 PetriNetUnfolderBase]: 5292/9112 cut-off events. [2024-05-12 11:35:58,872 INFO L125 PetriNetUnfolderBase]: For 280341/280447 co-relation queries the response was YES. [2024-05-12 11:35:58,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59021 conditions, 9112 events. 5292/9112 cut-off events. For 280341/280447 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 66222 event pairs, 1483 based on Foata normal form. 28/8768 useless extension candidates. Maximal degree in co-relation 58923. Up to 7383 conditions per place. [2024-05-12 11:35:58,966 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 283 selfloop transitions, 31 changer transitions 0/341 dead transitions. [2024-05-12 11:35:58,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 341 transitions, 4306 flow [2024-05-12 11:35:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:35:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:35:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:35:58,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2024-05-12 11:35:58,967 INFO L175 Difference]: Start difference. First operand has 218 places, 301 transitions, 3271 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:35:58,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 341 transitions, 4306 flow [2024-05-12 11:35:59,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 341 transitions, 4212 flow, removed 39 selfloop flow, removed 4 redundant places. [2024-05-12 11:35:59,269 INFO L231 Difference]: Finished difference. Result has 223 places, 309 transitions, 3432 flow [2024-05-12 11:35:59,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3177, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3432, PETRI_PLACES=223, PETRI_TRANSITIONS=309} [2024-05-12 11:35:59,270 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 169 predicate places. [2024-05-12 11:35:59,270 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 309 transitions, 3432 flow [2024-05-12 11:35:59,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:35:59,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:35:59,270 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 11:35:59,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 11:35:59,271 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 11:35:59,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:35:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash -295163841, now seen corresponding path program 4 times [2024-05-12 11:35:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:35:59,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910851806] [2024-05-12 11:35:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:35:59,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:35:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:14,143 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:36:14,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:14,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910851806] [2024-05-12 11:36:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910851806] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:14,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:36:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286893380] [2024-05-12 11:36:14,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:14,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:36:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:14,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:36:14,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:36:14,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:36:14,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 309 transitions, 3432 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:36:14,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:14,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:36:14,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:17,057 INFO L124 PetriNetUnfolderBase]: 5305/9182 cut-off events. [2024-05-12 11:36:17,057 INFO L125 PetriNetUnfolderBase]: For 291362/291480 co-relation queries the response was YES. [2024-05-12 11:36:17,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60417 conditions, 9182 events. 5305/9182 cut-off events. For 291362/291480 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 67009 event pairs, 1477 based on Foata normal form. 30/8840 useless extension candidates. Maximal degree in co-relation 60316. Up to 7350 conditions per place. [2024-05-12 11:36:17,158 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 276 selfloop transitions, 43 changer transitions 0/346 dead transitions. [2024-05-12 11:36:17,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 346 transitions, 4345 flow [2024-05-12 11:36:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:36:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:36:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-05-12 11:36:17,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:36:17,159 INFO L175 Difference]: Start difference. First operand has 223 places, 309 transitions, 3432 flow. Second operand 8 states and 192 transitions. [2024-05-12 11:36:17,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 346 transitions, 4345 flow [2024-05-12 11:36:17,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 346 transitions, 4174 flow, removed 73 selfloop flow, removed 4 redundant places. [2024-05-12 11:36:17,529 INFO L231 Difference]: Finished difference. Result has 228 places, 316 transitions, 3534 flow [2024-05-12 11:36:17,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3313, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3534, PETRI_PLACES=228, PETRI_TRANSITIONS=316} [2024-05-12 11:36:17,529 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 174 predicate places. [2024-05-12 11:36:17,529 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 316 transitions, 3534 flow [2024-05-12 11:36:17,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:36:17,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:17,530 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 11:36:17,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 11:36:17,530 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 11:36:17,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -294856011, now seen corresponding path program 1 times [2024-05-12 11:36:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275319307] [2024-05-12 11:36:17,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:30,457 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:36:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:30,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275319307] [2024-05-12 11:36:30,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275319307] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:30,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:30,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202527805] [2024-05-12 11:36:30,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:30,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:30,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2024-05-12 11:36:30,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 316 transitions, 3534 flow. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:36:30,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:30,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2024-05-12 11:36:30,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:33,414 INFO L124 PetriNetUnfolderBase]: 5214/8998 cut-off events. [2024-05-12 11:36:33,414 INFO L125 PetriNetUnfolderBase]: For 299958/300060 co-relation queries the response was YES. [2024-05-12 11:36:33,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60380 conditions, 8998 events. 5214/8998 cut-off events. For 299958/300060 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 65465 event pairs, 1557 based on Foata normal form. 23/8654 useless extension candidates. Maximal degree in co-relation 60276. Up to 7363 conditions per place. [2024-05-12 11:36:33,530 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 279 selfloop transitions, 25 changer transitions 0/353 dead transitions. [2024-05-12 11:36:33,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 353 transitions, 4339 flow [2024-05-12 11:36:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:36:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:36:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-05-12 11:36:33,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837962962962963 [2024-05-12 11:36:33,532 INFO L175 Difference]: Start difference. First operand has 228 places, 316 transitions, 3534 flow. Second operand 9 states and 209 transitions. [2024-05-12 11:36:33,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 353 transitions, 4339 flow [2024-05-12 11:36:33,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 353 transitions, 4214 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-05-12 11:36:33,999 INFO L231 Difference]: Finished difference. Result has 232 places, 318 transitions, 3528 flow [2024-05-12 11:36:33,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3409, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3528, PETRI_PLACES=232, PETRI_TRANSITIONS=318} [2024-05-12 11:36:34,000 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 178 predicate places. [2024-05-12 11:36:34,000 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 318 transitions, 3528 flow [2024-05-12 11:36:34,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:36:34,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:34,000 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 11:36:34,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 11:36:34,001 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 11:36:34,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:34,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1923248539, now seen corresponding path program 1 times [2024-05-12 11:36:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594749469] [2024-05-12 11:36:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:36:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:36:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:36:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594749469] [2024-05-12 11:36:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594749469] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:36:45,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:36:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:36:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166279309] [2024-05-12 11:36:45,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:36:45,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:36:45,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:36:45,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:36:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:36:45,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:36:45,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 318 transitions, 3528 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 11:36:45,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:36:45,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:36:45,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:36:48,794 INFO L124 PetriNetUnfolderBase]: 5867/9644 cut-off events. [2024-05-12 11:36:48,794 INFO L125 PetriNetUnfolderBase]: For 314895/314969 co-relation queries the response was YES. [2024-05-12 11:36:48,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65384 conditions, 9644 events. 5867/9644 cut-off events. For 314895/314969 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 66781 event pairs, 1746 based on Foata normal form. 5/9330 useless extension candidates. Maximal degree in co-relation 65279. Up to 8363 conditions per place. [2024-05-12 11:36:48,899 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 323 selfloop transitions, 22 changer transitions 0/363 dead transitions. [2024-05-12 11:36:48,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 363 transitions, 4461 flow [2024-05-12 11:36:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:36:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:36:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 11:36:48,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2024-05-12 11:36:48,900 INFO L175 Difference]: Start difference. First operand has 232 places, 318 transitions, 3528 flow. Second operand 8 states and 193 transitions. [2024-05-12 11:36:48,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 363 transitions, 4461 flow [2024-05-12 11:36:49,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 363 transitions, 4335 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-05-12 11:36:49,288 INFO L231 Difference]: Finished difference. Result has 234 places, 325 transitions, 3591 flow [2024-05-12 11:36:49,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3591, PETRI_PLACES=234, PETRI_TRANSITIONS=325} [2024-05-12 11:36:49,289 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 180 predicate places. [2024-05-12 11:36:49,289 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 325 transitions, 3591 flow [2024-05-12 11:36:49,289 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 11:36:49,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:36:49,289 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 11:36:49,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 11:36:49,289 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 11:36:49,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:36:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash 981891717, now seen corresponding path program 2 times [2024-05-12 11:36:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:36:49,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809801152] [2024-05-12 11:36:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:36:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:36:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:00,603 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:37:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:00,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809801152] [2024-05-12 11:37:00,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809801152] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:00,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:00,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:37:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328008272] [2024-05-12 11:37:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:00,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:37:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:00,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:37:00,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:37:00,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:37:00,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 325 transitions, 3591 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 11:37:00,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:00,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:37:00,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:03,999 INFO L124 PetriNetUnfolderBase]: 5923/9736 cut-off events. [2024-05-12 11:37:03,999 INFO L125 PetriNetUnfolderBase]: For 332960/333036 co-relation queries the response was YES. [2024-05-12 11:37:04,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67156 conditions, 9736 events. 5923/9736 cut-off events. For 332960/333036 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 67520 event pairs, 1748 based on Foata normal form. 5/9418 useless extension candidates. Maximal degree in co-relation 67049. Up to 8405 conditions per place. [2024-05-12 11:37:04,112 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 329 selfloop transitions, 31 changer transitions 0/378 dead transitions. [2024-05-12 11:37:04,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 378 transitions, 4622 flow [2024-05-12 11:37:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:37:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:37:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-05-12 11:37:04,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:37:04,113 INFO L175 Difference]: Start difference. First operand has 234 places, 325 transitions, 3591 flow. Second operand 9 states and 216 transitions. [2024-05-12 11:37:04,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 378 transitions, 4622 flow [2024-05-12 11:37:04,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 378 transitions, 4501 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-05-12 11:37:04,518 INFO L231 Difference]: Finished difference. Result has 239 places, 334 transitions, 3712 flow [2024-05-12 11:37:04,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3470, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3712, PETRI_PLACES=239, PETRI_TRANSITIONS=334} [2024-05-12 11:37:04,518 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 185 predicate places. [2024-05-12 11:37:04,518 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 334 transitions, 3712 flow [2024-05-12 11:37:04,519 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 11:37:04,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:04,519 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 11:37:04,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 11:37:04,519 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 11:37:04,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1091617953, now seen corresponding path program 1 times [2024-05-12 11:37:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203891365] [2024-05-12 11:37:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:16,370 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:37:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203891365] [2024-05-12 11:37:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203891365] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:37:16,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055327642] [2024-05-12 11:37:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:16,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:37:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:16,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:37:16,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:37:16,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:37:16,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 334 transitions, 3712 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 11:37:16,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:16,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:37:16,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:19,648 INFO L124 PetriNetUnfolderBase]: 5940/9759 cut-off events. [2024-05-12 11:37:19,649 INFO L125 PetriNetUnfolderBase]: For 349126/349211 co-relation queries the response was YES. [2024-05-12 11:37:19,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68284 conditions, 9759 events. 5940/9759 cut-off events. For 349126/349211 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 67665 event pairs, 1751 based on Foata normal form. 6/9439 useless extension candidates. Maximal degree in co-relation 68175. Up to 8412 conditions per place. [2024-05-12 11:37:19,773 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 326 selfloop transitions, 38 changer transitions 0/382 dead transitions. [2024-05-12 11:37:19,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 382 transitions, 4767 flow [2024-05-12 11:37:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:37:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:37:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 11:37:19,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026041666666666 [2024-05-12 11:37:19,775 INFO L175 Difference]: Start difference. First operand has 239 places, 334 transitions, 3712 flow. Second operand 8 states and 193 transitions. [2024-05-12 11:37:19,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 382 transitions, 4767 flow [2024-05-12 11:37:20,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 382 transitions, 4639 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-05-12 11:37:20,223 INFO L231 Difference]: Finished difference. Result has 243 places, 348 transitions, 3947 flow [2024-05-12 11:37:20,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3584, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3947, PETRI_PLACES=243, PETRI_TRANSITIONS=348} [2024-05-12 11:37:20,223 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 189 predicate places. [2024-05-12 11:37:20,223 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 348 transitions, 3947 flow [2024-05-12 11:37:20,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 11:37:20,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:20,224 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 11:37:20,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 11:37:20,224 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 11:37:20,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1091439207, now seen corresponding path program 3 times [2024-05-12 11:37:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692544033] [2024-05-12 11:37:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:37:31,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:31,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692544033] [2024-05-12 11:37:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692544033] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:37:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985020560] [2024-05-12 11:37:31,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:31,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:37:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:37:31,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:37:31,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:37:31,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 348 transitions, 3947 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 11:37:31,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:31,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:37:31,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:34,298 INFO L124 PetriNetUnfolderBase]: 5982/9825 cut-off events. [2024-05-12 11:37:34,298 INFO L125 PetriNetUnfolderBase]: For 371377/371463 co-relation queries the response was YES. [2024-05-12 11:37:34,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70286 conditions, 9825 events. 5982/9825 cut-off events. For 371377/371463 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 68128 event pairs, 1747 based on Foata normal form. 11/9510 useless extension candidates. Maximal degree in co-relation 70174. Up to 8451 conditions per place. [2024-05-12 11:37:34,417 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 339 selfloop transitions, 38 changer transitions 0/395 dead transitions. [2024-05-12 11:37:34,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 395 transitions, 5014 flow [2024-05-12 11:37:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:37:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:37:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-05-12 11:37:34,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2024-05-12 11:37:34,418 INFO L175 Difference]: Start difference. First operand has 243 places, 348 transitions, 3947 flow. Second operand 8 states and 194 transitions. [2024-05-12 11:37:34,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 395 transitions, 5014 flow [2024-05-12 11:37:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 395 transitions, 4869 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-05-12 11:37:34,832 INFO L231 Difference]: Finished difference. Result has 249 places, 359 transitions, 4117 flow [2024-05-12 11:37:34,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3802, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4117, PETRI_PLACES=249, PETRI_TRANSITIONS=359} [2024-05-12 11:37:34,833 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 195 predicate places. [2024-05-12 11:37:34,833 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 359 transitions, 4117 flow [2024-05-12 11:37:34,833 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 11:37:34,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:34,833 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 11:37:34,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 11:37:34,833 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 11:37:34,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1091738667, now seen corresponding path program 4 times [2024-05-12 11:37:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820885463] [2024-05-12 11:37:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:37:45,717 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:37:45,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:37:45,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820885463] [2024-05-12 11:37:45,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820885463] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:37:45,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:37:45,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:37:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403310482] [2024-05-12 11:37:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:37:45,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:37:45,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:37:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:37:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:37:45,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:37:45,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 359 transitions, 4117 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 11:37:45,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:37:45,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:37:45,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:37:49,062 INFO L124 PetriNetUnfolderBase]: 6012/9895 cut-off events. [2024-05-12 11:37:49,062 INFO L125 PetriNetUnfolderBase]: For 400689/400778 co-relation queries the response was YES. [2024-05-12 11:37:49,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72528 conditions, 9895 events. 6012/9895 cut-off events. For 400689/400778 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 68897 event pairs, 1745 based on Foata normal form. 11/9576 useless extension candidates. Maximal degree in co-relation 72413. Up to 8423 conditions per place. [2024-05-12 11:37:49,193 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 334 selfloop transitions, 46 changer transitions 0/398 dead transitions. [2024-05-12 11:37:49,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 398 transitions, 5142 flow [2024-05-12 11:37:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:37:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:37:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-05-12 11:37:49,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2024-05-12 11:37:49,195 INFO L175 Difference]: Start difference. First operand has 249 places, 359 transitions, 4117 flow. Second operand 8 states and 194 transitions. [2024-05-12 11:37:49,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 398 transitions, 5142 flow [2024-05-12 11:37:49,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 398 transitions, 4973 flow, removed 59 selfloop flow, removed 4 redundant places. [2024-05-12 11:37:49,699 INFO L231 Difference]: Finished difference. Result has 253 places, 362 transitions, 4154 flow [2024-05-12 11:37:49,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3948, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4154, PETRI_PLACES=253, PETRI_TRANSITIONS=362} [2024-05-12 11:37:49,700 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 199 predicate places. [2024-05-12 11:37:49,700 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 362 transitions, 4154 flow [2024-05-12 11:37:49,701 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 11:37:49,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:37:49,701 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 11:37:49,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 11:37:49,701 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 11:37:49,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:37:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1870288386, now seen corresponding path program 1 times [2024-05-12 11:37:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:37:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612190339] [2024-05-12 11:37:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:37:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:37:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:01,595 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:38:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612190339] [2024-05-12 11:38:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612190339] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:01,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:38:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248408149] [2024-05-12 11:38:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:01,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:38:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:38:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:38:01,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:38:01,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 362 transitions, 4154 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 11:38:01,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:01,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:38:01,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:04,885 INFO L124 PetriNetUnfolderBase]: 6057/9938 cut-off events. [2024-05-12 11:38:04,886 INFO L125 PetriNetUnfolderBase]: For 420211/420304 co-relation queries the response was YES. [2024-05-12 11:38:04,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73812 conditions, 9938 events. 6057/9938 cut-off events. For 420211/420304 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 68976 event pairs, 1740 based on Foata normal form. 13/9623 useless extension candidates. Maximal degree in co-relation 73696. Up to 8587 conditions per place. [2024-05-12 11:38:05,013 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 353 selfloop transitions, 29 changer transitions 0/400 dead transitions. [2024-05-12 11:38:05,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 400 transitions, 5151 flow [2024-05-12 11:38:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:38:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:38:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-05-12 11:38:05,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2024-05-12 11:38:05,014 INFO L175 Difference]: Start difference. First operand has 253 places, 362 transitions, 4154 flow. Second operand 8 states and 191 transitions. [2024-05-12 11:38:05,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 400 transitions, 5151 flow [2024-05-12 11:38:05,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 400 transitions, 4973 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-05-12 11:38:05,578 INFO L231 Difference]: Finished difference. Result has 255 places, 366 transitions, 4141 flow [2024-05-12 11:38:05,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3976, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4141, PETRI_PLACES=255, PETRI_TRANSITIONS=366} [2024-05-12 11:38:05,578 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 201 predicate places. [2024-05-12 11:38:05,579 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 366 transitions, 4141 flow [2024-05-12 11:38:05,579 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 11:38:05,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:05,579 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 11:38:05,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 11:38:05,579 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 11:38:05,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1269792747, now seen corresponding path program 5 times [2024-05-12 11:38:05,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66991198] [2024-05-12 11:38:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:16,711 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:38:16,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66991198] [2024-05-12 11:38:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66991198] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:16,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:38:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542381140] [2024-05-12 11:38:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:16,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:38:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:38:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:38:16,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:38:16,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 366 transitions, 4141 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 11:38:16,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:16,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:38:16,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:19,934 INFO L124 PetriNetUnfolderBase]: 6174/10141 cut-off events. [2024-05-12 11:38:19,934 INFO L125 PetriNetUnfolderBase]: For 454117/454209 co-relation queries the response was YES. [2024-05-12 11:38:20,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77206 conditions, 10141 events. 6174/10141 cut-off events. For 454117/454209 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 70690 event pairs, 1748 based on Foata normal form. 11/9815 useless extension candidates. Maximal degree in co-relation 77089. Up to 8455 conditions per place. [2024-05-12 11:38:20,071 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 319 selfloop transitions, 76 changer transitions 0/413 dead transitions. [2024-05-12 11:38:20,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 413 transitions, 5694 flow [2024-05-12 11:38:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:38:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:38:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-05-12 11:38:20,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-05-12 11:38:20,072 INFO L175 Difference]: Start difference. First operand has 255 places, 366 transitions, 4141 flow. Second operand 8 states and 196 transitions. [2024-05-12 11:38:20,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 413 transitions, 5694 flow [2024-05-12 11:38:20,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 413 transitions, 5559 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-05-12 11:38:20,924 INFO L231 Difference]: Finished difference. Result has 257 places, 375 transitions, 4500 flow [2024-05-12 11:38:20,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4006, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4500, PETRI_PLACES=257, PETRI_TRANSITIONS=375} [2024-05-12 11:38:20,924 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 203 predicate places. [2024-05-12 11:38:20,924 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 375 transitions, 4500 flow [2024-05-12 11:38:20,925 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 11:38:20,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:20,925 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 11:38:20,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 11:38:20,925 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 11:38:20,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1269793150, now seen corresponding path program 2 times [2024-05-12 11:38:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:20,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632880324] [2024-05-12 11:38:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:20,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:33,375 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:38:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632880324] [2024-05-12 11:38:33,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632880324] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:33,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:33,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:38:33,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653436952] [2024-05-12 11:38:33,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:33,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:38:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:38:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:38:33,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:38:33,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 375 transitions, 4500 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 11:38:33,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:33,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:38:33,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:36,728 INFO L124 PetriNetUnfolderBase]: 6216/10191 cut-off events. [2024-05-12 11:38:36,729 INFO L125 PetriNetUnfolderBase]: For 479797/479895 co-relation queries the response was YES. [2024-05-12 11:38:36,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78888 conditions, 10191 events. 6216/10191 cut-off events. For 479797/479895 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 70914 event pairs, 1747 based on Foata normal form. 13/9868 useless extension candidates. Maximal degree in co-relation 78770. Up to 8747 conditions per place. [2024-05-12 11:38:36,870 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 356 selfloop transitions, 39 changer transitions 0/413 dead transitions. [2024-05-12 11:38:36,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 413 transitions, 5573 flow [2024-05-12 11:38:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:38:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:38:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-05-12 11:38:36,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2024-05-12 11:38:36,872 INFO L175 Difference]: Start difference. First operand has 257 places, 375 transitions, 4500 flow. Second operand 8 states and 191 transitions. [2024-05-12 11:38:36,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 413 transitions, 5573 flow [2024-05-12 11:38:37,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 413 transitions, 5420 flow, removed 59 selfloop flow, removed 3 redundant places. [2024-05-12 11:38:37,686 INFO L231 Difference]: Finished difference. Result has 262 places, 379 transitions, 4542 flow [2024-05-12 11:38:37,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4347, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4542, PETRI_PLACES=262, PETRI_TRANSITIONS=379} [2024-05-12 11:38:37,687 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 208 predicate places. [2024-05-12 11:38:37,687 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 379 transitions, 4542 flow [2024-05-12 11:38:37,687 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 11:38:37,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:37,687 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 11:38:37,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 11:38:37,687 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 11:38:37,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1692354679, now seen corresponding path program 6 times [2024-05-12 11:38:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291733283] [2024-05-12 11:38:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:37,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:38:48,722 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:38:48,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:38:48,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291733283] [2024-05-12 11:38:48,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291733283] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:38:48,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:38:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:38:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229263848] [2024-05-12 11:38:48,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:38:48,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:38:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:38:48,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:38:48,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:38:48,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:38:48,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 379 transitions, 4542 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 11:38:48,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:38:48,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:38:48,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:38:52,204 INFO L124 PetriNetUnfolderBase]: 6210/10189 cut-off events. [2024-05-12 11:38:52,204 INFO L125 PetriNetUnfolderBase]: For 489970/490060 co-relation queries the response was YES. [2024-05-12 11:38:52,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79744 conditions, 10189 events. 6210/10189 cut-off events. For 489970/490060 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 70966 event pairs, 1761 based on Foata normal form. 10/9862 useless extension candidates. Maximal degree in co-relation 79624. Up to 8801 conditions per place. [2024-05-12 11:38:52,341 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 362 selfloop transitions, 33 changer transitions 0/413 dead transitions. [2024-05-12 11:38:52,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 413 transitions, 5499 flow [2024-05-12 11:38:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:38:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:38:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-05-12 11:38:52,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-05-12 11:38:52,343 INFO L175 Difference]: Start difference. First operand has 262 places, 379 transitions, 4542 flow. Second operand 8 states and 188 transitions. [2024-05-12 11:38:52,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 413 transitions, 5499 flow [2024-05-12 11:38:53,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 413 transitions, 5260 flow, removed 83 selfloop flow, removed 6 redundant places. [2024-05-12 11:38:53,154 INFO L231 Difference]: Finished difference. Result has 264 places, 379 transitions, 4376 flow [2024-05-12 11:38:53,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4303, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4376, PETRI_PLACES=264, PETRI_TRANSITIONS=379} [2024-05-12 11:38:53,154 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 210 predicate places. [2024-05-12 11:38:53,155 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 379 transitions, 4376 flow [2024-05-12 11:38:53,155 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 11:38:53,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:38:53,155 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 11:38:53,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 11:38:53,155 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 11:38:53,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:38:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1270060060, now seen corresponding path program 3 times [2024-05-12 11:38:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:38:53,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111422170] [2024-05-12 11:38:53,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:38:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:38:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:05,386 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:39:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111422170] [2024-05-12 11:39:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111422170] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:39:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198701344] [2024-05-12 11:39:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:05,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:39:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:05,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:39:05,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:39:05,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:39:05,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 379 transitions, 4376 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 11:39:05,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:05,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:39:05,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:39:08,838 INFO L124 PetriNetUnfolderBase]: 6267/10266 cut-off events. [2024-05-12 11:39:08,838 INFO L125 PetriNetUnfolderBase]: For 496965/497074 co-relation queries the response was YES. [2024-05-12 11:39:08,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80017 conditions, 10266 events. 6267/10266 cut-off events. For 496965/497074 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 71454 event pairs, 1746 based on Foata normal form. 25/9956 useless extension candidates. Maximal degree in co-relation 79896. Up to 8745 conditions per place. [2024-05-12 11:39:08,971 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 354 selfloop transitions, 52 changer transitions 0/424 dead transitions. [2024-05-12 11:39:08,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 424 transitions, 5675 flow [2024-05-12 11:39:08,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:39:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:39:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-05-12 11:39:08,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 11:39:08,973 INFO L175 Difference]: Start difference. First operand has 264 places, 379 transitions, 4376 flow. Second operand 8 states and 192 transitions. [2024-05-12 11:39:08,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 424 transitions, 5675 flow [2024-05-12 11:39:09,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 424 transitions, 5542 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-05-12 11:39:09,587 INFO L231 Difference]: Finished difference. Result has 265 places, 390 transitions, 4597 flow [2024-05-12 11:39:09,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4243, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4597, PETRI_PLACES=265, PETRI_TRANSITIONS=390} [2024-05-12 11:39:09,588 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 211 predicate places. [2024-05-12 11:39:09,588 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 390 transitions, 4597 flow [2024-05-12 11:39:09,588 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 11:39:09,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:39:09,588 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 11:39:09,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 11:39:09,589 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 11:39:09,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:39:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 973288101, now seen corresponding path program 1 times [2024-05-12 11:39:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:39:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398642167] [2024-05-12 11:39:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:39:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:39:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:39:20,311 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:39:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:39:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398642167] [2024-05-12 11:39:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398642167] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:39:20,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:39:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 11:39:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710613063] [2024-05-12 11:39:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:39:20,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 11:39:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:39:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 11:39:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 11:39:20,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2024-05-12 11:39:20,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 390 transitions, 4597 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 11:39:20,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:39:20,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2024-05-12 11:39:20,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15