./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix006.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix006.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:31:15,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:31:15,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:31:15,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:31:15,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:31:15,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:31:15,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:31:15,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:31:15,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:31:15,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:31:15,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:31:15,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:31:15,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:31:15,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:31:15,777 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:31:15,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:31:15,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:31:15,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:31:15,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:31:15,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:31:15,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:31:15,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:31:15,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:31:15,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:31:15,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:31:15,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:31:15,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:31:15,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:31:15,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:31:15,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:31:15,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:31:15,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:31:15,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:31:15,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:31:15,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:31:15,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:31:15,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:31:15,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:31:15,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:31:15,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:31:15,782 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:31:15,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:31:15,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:31:15,783 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:31:16,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:31:16,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:31:16,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:31:16,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:31:16,063 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:31:16,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-06-04 16:31:16,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:31:17,175 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:31:17,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-06-04 16:31:17,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a690c53f/384afaafb7444ee4a3baa0746c068e07/FLAGed24facba [2024-06-04 16:31:17,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a690c53f/384afaafb7444ee4a3baa0746c068e07 [2024-06-04 16:31:17,215 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:31:17,216 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:31:17,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix006.opt.yml/witness.yml [2024-06-04 16:31:17,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:31:17,388 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:31:17,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:31:17,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:31:17,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:31:17,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:31:17" (1/2) ... [2024-06-04 16:31:17,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d6c5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:31:17, skipping insertion in model container [2024-06-04 16:31:17,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:31:17" (1/2) ... [2024-06-04 16:31:17,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f93f102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:31:17, skipping insertion in model container [2024-06-04 16:31:17,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:31:17" (2/2) ... [2024-06-04 16:31:17,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d6c5d5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:17, skipping insertion in model container [2024-06-04 16:31:17,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:31:17" (2/2) ... [2024-06-04 16:31:17,396 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:31:17,465 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:31:17,466 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 <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_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_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! 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_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! 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-06-04 16:31:17,467 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] ((((((((((((((((((((! 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 <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_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_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! 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_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! 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-06-04 16:31:17,468 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] ((((((((((((((((((((! 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 <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )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_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_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_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! 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_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! 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-06-04 16:31:17,468 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:31:17,468 INFO L106 edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1; [2024-06-04 16:31:17,508 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:31:17,804 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:31:17,816 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:31:18,106 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:31:18,139 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:31:18,140 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18 WrapperNode [2024-06-04 16:31:18,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:31:18,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:31:18,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:31:18,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:31:18,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,272 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-06-04 16:31:18,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:31:18,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:31:18,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:31:18,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:31:18,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,416 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:31:18,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:31:18,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:31:18,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:31:18,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:31:18,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (1/1) ... [2024-06-04 16:31:18,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:31:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:31:18,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:31:18,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 16:31:18,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 16:31:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 16:31:18,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 16:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 16:31:18,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 16:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:31:18,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:31:18,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:31:18,551 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:31:18,652 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:31:18,654 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:31:19,900 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:31:19,901 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:31:20,179 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:31:20,180 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:31:20,181 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:31:20 BoogieIcfgContainer [2024-06-04 16:31:20,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:31:20,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:31:20,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:31:20,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:31:20,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:31:17" (1/4) ... [2024-06-04 16:31:20,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bf568b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:31:20, skipping insertion in model container [2024-06-04 16:31:20,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:31:17" (2/4) ... [2024-06-04 16:31:20,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bf568b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:31:20, skipping insertion in model container [2024-06-04 16:31:20,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:31:18" (3/4) ... [2024-06-04 16:31:20,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bf568b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:31:20, skipping insertion in model container [2024-06-04 16:31:20,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:31:20" (4/4) ... [2024-06-04 16:31:20,190 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2024-06-04 16:31:20,204 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:31:20,204 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 16:31:20,204 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:31:20,311 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 16:31:20,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow [2024-06-04 16:31:20,404 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-06-04 16:31:20,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:31:20,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 16:31:20,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow [2024-06-04 16:31:20,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2024-06-04 16:31:20,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:31:20,420 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;@49fb304d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:31:20,420 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 16:31:20,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:31:20,427 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 16:31:20,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:31:20,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:20,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:31:20,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:31:20,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash -518097545, now seen corresponding path program 1 times [2024-06-04 16:31:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26235460] [2024-06-04 16:31:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:25,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26235460] [2024-06-04 16:31:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26235460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:25,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:31:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898429294] [2024-06-04 16:31:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:25,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:31:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:25,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:31:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:31:26,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-04 16:31:26,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:26,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:26,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-04 16:31:26,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:26,817 INFO L124 PetriNetUnfolderBase]: 1116/1777 cut-off events. [2024-06-04 16:31:26,817 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-04 16:31:26,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3530 conditions, 1777 events. 1116/1777 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8994 event pairs, 765 based on Foata normal form. 1/1708 useless extension candidates. Maximal degree in co-relation 3515. Up to 1676 conditions per place. [2024-06-04 16:31:26,829 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-04 16:31:26,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 177 flow [2024-06-04 16:31:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:31:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:31:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-04 16:31:26,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2024-06-04 16:31:26,839 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 79 transitions. [2024-06-04 16:31:26,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 177 flow [2024-06-04 16:31:26,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 16:31:26,843 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow [2024-06-04 16:31:26,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-04 16:31:26,846 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-06-04 16:31:26,846 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow [2024-06-04 16:31:26,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:26,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:26,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:26,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:31:26,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:31:26,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash 324486806, now seen corresponding path program 1 times [2024-06-04 16:31:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:26,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52737011] [2024-06-04 16:31:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:26,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52737011] [2024-06-04 16:31:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52737011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:30,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:30,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:31:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797540842] [2024-06-04 16:31:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:30,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:31:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:30,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:31:30,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:31:30,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 16:31:30,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:30,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:30,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 16:31:30,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:31,733 INFO L124 PetriNetUnfolderBase]: 1280/1983 cut-off events. [2024-06-04 16:31:31,733 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2024-06-04 16:31:31,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 1983 events. 1280/1983 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9834 event pairs, 750 based on Foata normal form. 3/1979 useless extension candidates. Maximal degree in co-relation 4491. Up to 1897 conditions per place. [2024-06-04 16:31:31,744 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 41 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2024-06-04 16:31:31,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 246 flow [2024-06-04 16:31:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:31:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:31:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-06-04 16:31:31,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5755813953488372 [2024-06-04 16:31:31,748 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 99 transitions. [2024-06-04 16:31:31,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 246 flow [2024-06-04 16:31:31,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:31:31,751 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow [2024-06-04 16:31:31,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-04 16:31:31,752 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2024-06-04 16:31:31,752 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow [2024-06-04 16:31:31,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:31,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:31,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:31:31,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:31:31,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1469157118, now seen corresponding path program 1 times [2024-06-04 16:31:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:31,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090574211] [2024-06-04 16:31:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:35,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:35,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090574211] [2024-06-04 16:31:35,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090574211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:35,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:35,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:31:35,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118608652] [2024-06-04 16:31:35,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:35,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:31:35,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:35,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:31:35,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:31:35,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:31:35,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:35,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:35,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:31:35,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:36,611 INFO L124 PetriNetUnfolderBase]: 1568/2407 cut-off events. [2024-06-04 16:31:36,611 INFO L125 PetriNetUnfolderBase]: For 1355/1355 co-relation queries the response was YES. [2024-06-04 16:31:36,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6042 conditions, 2407 events. 1568/2407 cut-off events. For 1355/1355 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11980 event pairs, 669 based on Foata normal form. 5/2407 useless extension candidates. Maximal degree in co-relation 6025. Up to 2248 conditions per place. [2024-06-04 16:31:36,624 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2024-06-04 16:31:36,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 402 flow [2024-06-04 16:31:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:31:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:31:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-06-04 16:31:36,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2024-06-04 16:31:36,626 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 125 transitions. [2024-06-04 16:31:36,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 402 flow [2024-06-04 16:31:36,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 388 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 16:31:36,629 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 239 flow [2024-06-04 16:31:36,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2024-06-04 16:31:36,630 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2024-06-04 16:31:36,630 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 239 flow [2024-06-04 16:31:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:36,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:36,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:36,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:31:36,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:31:36,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1184225795, now seen corresponding path program 1 times [2024-06-04 16:31:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:36,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394287230] [2024-06-04 16:31:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394287230] [2024-06-04 16:31:41,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394287230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:41,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:41,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:31:41,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796112626] [2024-06-04 16:31:41,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:41,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:31:41,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:41,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:31:41,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:31:41,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:31:41,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:41,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:41,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:31:41,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:42,332 INFO L124 PetriNetUnfolderBase]: 1580/2427 cut-off events. [2024-06-04 16:31:42,333 INFO L125 PetriNetUnfolderBase]: For 3211/3214 co-relation queries the response was YES. [2024-06-04 16:31:42,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7186 conditions, 2427 events. 1580/2427 cut-off events. For 3211/3214 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12093 event pairs, 481 based on Foata normal form. 12/2434 useless extension candidates. Maximal degree in co-relation 7166. Up to 2216 conditions per place. [2024-06-04 16:31:42,348 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2024-06-04 16:31:42,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 505 flow [2024-06-04 16:31:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:31:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:31:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-06-04 16:31:42,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5542635658914729 [2024-06-04 16:31:42,352 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 239 flow. Second operand 6 states and 143 transitions. [2024-06-04 16:31:42,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 505 flow [2024-06-04 16:31:42,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 497 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 16:31:42,359 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 295 flow [2024-06-04 16:31:42,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-06-04 16:31:42,360 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2024-06-04 16:31:42,360 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 295 flow [2024-06-04 16:31:42,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:42,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:42,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:42,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:31:42,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:31:42,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1394666457, now seen corresponding path program 1 times [2024-06-04 16:31:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:42,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820861581] [2024-06-04 16:31:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820861581] [2024-06-04 16:31:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820861581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:31:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163399829] [2024-06-04 16:31:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:51,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:31:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:31:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:31:51,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:31:51,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:51,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:51,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:31:51,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:52,528 INFO L124 PetriNetUnfolderBase]: 1368/2160 cut-off events. [2024-06-04 16:31:52,529 INFO L125 PetriNetUnfolderBase]: For 4054/4054 co-relation queries the response was YES. [2024-06-04 16:31:52,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6932 conditions, 2160 events. 1368/2160 cut-off events. For 4054/4054 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10976 event pairs, 562 based on Foata normal form. 2/2134 useless extension candidates. Maximal degree in co-relation 6909. Up to 2036 conditions per place. [2024-06-04 16:31:52,544 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 50 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-06-04 16:31:52,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 439 flow [2024-06-04 16:31:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:31:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:31:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-04 16:31:52,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2024-06-04 16:31:52,546 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 295 flow. Second operand 5 states and 101 transitions. [2024-06-04 16:31:52,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 439 flow [2024-06-04 16:31:52,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 389 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 16:31:52,553 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 269 flow [2024-06-04 16:31:52,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-06-04 16:31:52,555 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2024-06-04 16:31:52,556 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 269 flow [2024-06-04 16:31:52,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:52,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:52,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:52,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:31:52,557 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:31:52,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -285879607, now seen corresponding path program 1 times [2024-06-04 16:31:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:52,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907036310] [2024-06-04 16:31:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:02,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907036310] [2024-06-04 16:32:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907036310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:02,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:02,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:32:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617705574] [2024-06-04 16:32:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:02,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:32:02,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:32:02,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:32:02,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:32:02,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 269 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:02,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:02,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:32:02,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:03,349 INFO L124 PetriNetUnfolderBase]: 1358/2172 cut-off events. [2024-06-04 16:32:03,349 INFO L125 PetriNetUnfolderBase]: For 4716/4716 co-relation queries the response was YES. [2024-06-04 16:32:03,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6940 conditions, 2172 events. 1358/2172 cut-off events. For 4716/4716 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11065 event pairs, 526 based on Foata normal form. 4/2166 useless extension candidates. Maximal degree in co-relation 6915. Up to 2004 conditions per place. [2024-06-04 16:32:03,365 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 55 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2024-06-04 16:32:03,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 459 flow [2024-06-04 16:32:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:32:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:32:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-04 16:32:03,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-04 16:32:03,366 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 269 flow. Second operand 6 states and 120 transitions. [2024-06-04 16:32:03,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 459 flow [2024-06-04 16:32:03,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 437 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:32:03,373 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 301 flow [2024-06-04 16:32:03,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2024-06-04 16:32:03,376 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2024-06-04 16:32:03,376 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 301 flow [2024-06-04 16:32:03,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:03,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:03,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:03,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:32:03,377 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:32:03,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1109222620, now seen corresponding path program 1 times [2024-06-04 16:32:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:03,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291191139] [2024-06-04 16:32:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:03,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291191139] [2024-06-04 16:32:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291191139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:12,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:32:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768689595] [2024-06-04 16:32:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:12,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:32:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:32:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:32:12,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:32:12,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:12,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:12,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:32:12,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:13,915 INFO L124 PetriNetUnfolderBase]: 1571/2394 cut-off events. [2024-06-04 16:32:13,915 INFO L125 PetriNetUnfolderBase]: For 7175/7175 co-relation queries the response was YES. [2024-06-04 16:32:13,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8369 conditions, 2394 events. 1571/2394 cut-off events. For 7175/7175 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11687 event pairs, 631 based on Foata normal form. 4/2396 useless extension candidates. Maximal degree in co-relation 8344. Up to 2253 conditions per place. [2024-06-04 16:32:13,926 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 64 selfloop transitions, 21 changer transitions 0/90 dead transitions. [2024-06-04 16:32:13,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 595 flow [2024-06-04 16:32:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-04 16:32:13,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622093023255814 [2024-06-04 16:32:13,929 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 301 flow. Second operand 8 states and 159 transitions. [2024-06-04 16:32:13,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 595 flow [2024-06-04 16:32:13,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 565 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 16:32:13,934 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 347 flow [2024-06-04 16:32:13,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=347, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-06-04 16:32:13,935 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2024-06-04 16:32:13,935 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 347 flow [2024-06-04 16:32:13,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:13,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:13,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:13,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:32:13,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:32:13,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -272339800, now seen corresponding path program 2 times [2024-06-04 16:32:13,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:13,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379455696] [2024-06-04 16:32:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:23,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379455696] [2024-06-04 16:32:23,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379455696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:23,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:23,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:32:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798379956] [2024-06-04 16:32:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:23,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:32:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:32:23,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:32:23,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:32:23,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:23,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:23,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:32:23,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:24,386 INFO L124 PetriNetUnfolderBase]: 1559/2374 cut-off events. [2024-06-04 16:32:24,386 INFO L125 PetriNetUnfolderBase]: For 8660/8670 co-relation queries the response was YES. [2024-06-04 16:32:24,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8558 conditions, 2374 events. 1559/2374 cut-off events. For 8660/8670 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11591 event pairs, 638 based on Foata normal form. 10/2381 useless extension candidates. Maximal degree in co-relation 8532. Up to 2237 conditions per place. [2024-06-04 16:32:24,399 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 21 changer transitions 0/81 dead transitions. [2024-06-04 16:32:24,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 555 flow [2024-06-04 16:32:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:32:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:32:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-04 16:32:24,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4584717607973422 [2024-06-04 16:32:24,400 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 347 flow. Second operand 7 states and 138 transitions. [2024-06-04 16:32:24,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 555 flow [2024-06-04 16:32:24,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 520 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 16:32:24,405 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 362 flow [2024-06-04 16:32:24,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-06-04 16:32:24,406 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2024-06-04 16:32:24,406 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 362 flow [2024-06-04 16:32:24,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:24,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:24,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:24,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:32:24,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:32:24,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 983751498, now seen corresponding path program 1 times [2024-06-04 16:32:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:24,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358607031] [2024-06-04 16:32:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:24,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:34,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:34,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358607031] [2024-06-04 16:32:34,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358607031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:34,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:34,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:32:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052977324] [2024-06-04 16:32:34,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:34,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:32:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:32:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:32:34,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:32:34,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 362 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:34,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:34,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:32:34,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:35,688 INFO L124 PetriNetUnfolderBase]: 1692/2594 cut-off events. [2024-06-04 16:32:35,688 INFO L125 PetriNetUnfolderBase]: For 11017/11019 co-relation queries the response was YES. [2024-06-04 16:32:35,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9649 conditions, 2594 events. 1692/2594 cut-off events. For 11017/11019 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12767 event pairs, 633 based on Foata normal form. 10/2602 useless extension candidates. Maximal degree in co-relation 9622. Up to 2383 conditions per place. [2024-06-04 16:32:35,701 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 81 selfloop transitions, 27 changer transitions 0/113 dead transitions. [2024-06-04 16:32:35,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 851 flow [2024-06-04 16:32:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:32:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:32:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-04 16:32:35,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599483204134367 [2024-06-04 16:32:35,704 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 362 flow. Second operand 9 states and 178 transitions. [2024-06-04 16:32:35,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 851 flow [2024-06-04 16:32:35,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 113 transitions, 751 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 16:32:35,714 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 520 flow [2024-06-04 16:32:35,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=520, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2024-06-04 16:32:35,716 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2024-06-04 16:32:35,717 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 520 flow [2024-06-04 16:32:35,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:35,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:35,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:35,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:32:35,717 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:32:35,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash 140973032, now seen corresponding path program 2 times [2024-06-04 16:32:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483201514] [2024-06-04 16:32:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:45,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483201514] [2024-06-04 16:32:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483201514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:45,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:32:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384401765] [2024-06-04 16:32:45,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:45,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:32:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:32:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:32:45,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:32:45,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 520 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:45,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:45,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:32:45,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:47,088 INFO L124 PetriNetUnfolderBase]: 1736/2668 cut-off events. [2024-06-04 16:32:47,088 INFO L125 PetriNetUnfolderBase]: For 14248/14252 co-relation queries the response was YES. [2024-06-04 16:32:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10751 conditions, 2668 events. 1736/2668 cut-off events. For 14248/14252 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13237 event pairs, 531 based on Foata normal form. 12/2678 useless extension candidates. Maximal degree in co-relation 10720. Up to 2246 conditions per place. [2024-06-04 16:32:47,103 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 73 selfloop transitions, 45 changer transitions 0/123 dead transitions. [2024-06-04 16:32:47,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 123 transitions, 968 flow [2024-06-04 16:32:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:32:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:32:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-04 16:32:47,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702842377260982 [2024-06-04 16:32:47,104 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 520 flow. Second operand 9 states and 182 transitions. [2024-06-04 16:32:47,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 123 transitions, 968 flow [2024-06-04 16:32:47,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 937 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-04 16:32:47,114 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 661 flow [2024-06-04 16:32:47,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=661, PETRI_PLACES=77, PETRI_TRANSITIONS=85} [2024-06-04 16:32:47,115 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2024-06-04 16:32:47,115 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 661 flow [2024-06-04 16:32:47,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:47,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:47,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:47,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:32:47,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:32:47,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 151207148, now seen corresponding path program 3 times [2024-06-04 16:32:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829756541] [2024-06-04 16:32:47,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829756541] [2024-06-04 16:32:57,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829756541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:57,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:32:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275860075] [2024-06-04 16:32:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:57,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:32:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:32:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:32:57,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:32:57,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 661 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:57,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:57,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:32:57,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:58,435 INFO L124 PetriNetUnfolderBase]: 1758/2712 cut-off events. [2024-06-04 16:32:58,435 INFO L125 PetriNetUnfolderBase]: For 17828/17841 co-relation queries the response was YES. [2024-06-04 16:32:58,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11844 conditions, 2712 events. 1758/2712 cut-off events. For 17828/17841 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13581 event pairs, 536 based on Foata normal form. 14/2722 useless extension candidates. Maximal degree in co-relation 11811. Up to 2255 conditions per place. [2024-06-04 16:32:58,451 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 67 selfloop transitions, 52 changer transitions 0/124 dead transitions. [2024-06-04 16:32:58,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 124 transitions, 1141 flow [2024-06-04 16:32:58,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-04 16:32:58,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2024-06-04 16:32:58,453 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 661 flow. Second operand 8 states and 165 transitions. [2024-06-04 16:32:58,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 124 transitions, 1141 flow [2024-06-04 16:32:58,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 124 transitions, 1068 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 16:32:58,470 INFO L231 Difference]: Finished difference. Result has 80 places, 91 transitions, 778 flow [2024-06-04 16:32:58,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=778, PETRI_PLACES=80, PETRI_TRANSITIONS=91} [2024-06-04 16:32:58,471 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2024-06-04 16:32:58,471 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 91 transitions, 778 flow [2024-06-04 16:32:58,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:58,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:58,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:58,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:32:58,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:32:58,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash -244201994, now seen corresponding path program 4 times [2024-06-04 16:32:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322533232] [2024-06-04 16:32:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322533232] [2024-06-04 16:33:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322533232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:08,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:08,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:33:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338006687] [2024-06-04 16:33:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:33:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:33:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:33:08,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:33:08,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 778 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:08,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:08,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:33:08,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:09,783 INFO L124 PetriNetUnfolderBase]: 1748/2698 cut-off events. [2024-06-04 16:33:09,783 INFO L125 PetriNetUnfolderBase]: For 17298/17311 co-relation queries the response was YES. [2024-06-04 16:33:09,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11685 conditions, 2698 events. 1748/2698 cut-off events. For 17298/17311 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13479 event pairs, 534 based on Foata normal form. 14/2708 useless extension candidates. Maximal degree in co-relation 11650. Up to 2251 conditions per place. [2024-06-04 16:33:09,795 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 68 selfloop transitions, 50 changer transitions 0/123 dead transitions. [2024-06-04 16:33:09,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 1146 flow [2024-06-04 16:33:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:33:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:33:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-06-04 16:33:09,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-04 16:33:09,796 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 778 flow. Second operand 8 states and 164 transitions. [2024-06-04 16:33:09,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 1146 flow [2024-06-04 16:33:09,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 123 transitions, 1062 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-04 16:33:09,815 INFO L231 Difference]: Finished difference. Result has 84 places, 91 transitions, 802 flow [2024-06-04 16:33:09,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=802, PETRI_PLACES=84, PETRI_TRANSITIONS=91} [2024-06-04 16:33:09,816 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2024-06-04 16:33:09,817 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 802 flow [2024-06-04 16:33:09,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:09,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:09,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:09,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:33:09,817 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:33:09,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash -633643069, now seen corresponding path program 1 times [2024-06-04 16:33:09,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:09,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643129767] [2024-06-04 16:33:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:09,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643129767] [2024-06-04 16:33:19,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643129767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:33:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790611109] [2024-06-04 16:33:19,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:19,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:33:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:19,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:33:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:33:19,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 16:33:19,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 802 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:19,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:19,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 16:33:19,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:20,717 INFO L124 PetriNetUnfolderBase]: 1441/2364 cut-off events. [2024-06-04 16:33:20,717 INFO L125 PetriNetUnfolderBase]: For 17020/17029 co-relation queries the response was YES. [2024-06-04 16:33:20,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10319 conditions, 2364 events. 1441/2364 cut-off events. For 17020/17029 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12579 event pairs, 507 based on Foata normal form. 10/2363 useless extension candidates. Maximal degree in co-relation 10283. Up to 2113 conditions per place. [2024-06-04 16:33:20,731 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 81 selfloop transitions, 8 changer transitions 0/102 dead transitions. [2024-06-04 16:33:20,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 102 transitions, 1024 flow [2024-06-04 16:33:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:33:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:33:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-04 16:33:20,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2024-06-04 16:33:20,732 INFO L175 Difference]: Start difference. First operand has 84 places, 91 transitions, 802 flow. Second operand 5 states and 101 transitions. [2024-06-04 16:33:20,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 102 transitions, 1024 flow [2024-06-04 16:33:20,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 102 transitions, 875 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 16:33:20,746 INFO L231 Difference]: Finished difference. Result has 81 places, 94 transitions, 701 flow [2024-06-04 16:33:20,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=701, PETRI_PLACES=81, PETRI_TRANSITIONS=94} [2024-06-04 16:33:20,746 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2024-06-04 16:33:20,747 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 701 flow [2024-06-04 16:33:20,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:20,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:20,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:20,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:33:20,747 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:33:20,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 879351268, now seen corresponding path program 1 times [2024-06-04 16:33:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546796115] [2024-06-04 16:33:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:31,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:31,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546796115] [2024-06-04 16:33:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546796115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:31,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:31,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:31,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744777066] [2024-06-04 16:33:31,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:31,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:31,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:33:31,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 701 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:31,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:31,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:33:31,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:33,402 INFO L124 PetriNetUnfolderBase]: 1789/2766 cut-off events. [2024-06-04 16:33:33,402 INFO L125 PetriNetUnfolderBase]: For 21373/21377 co-relation queries the response was YES. [2024-06-04 16:33:33,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12333 conditions, 2766 events. 1789/2766 cut-off events. For 21373/21377 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13882 event pairs, 532 based on Foata normal form. 12/2776 useless extension candidates. Maximal degree in co-relation 12296. Up to 2285 conditions per place. [2024-06-04 16:33:33,415 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 82 selfloop transitions, 55 changer transitions 0/142 dead transitions. [2024-06-04 16:33:33,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 142 transitions, 1216 flow [2024-06-04 16:33:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:33:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:33:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions. [2024-06-04 16:33:33,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-04 16:33:33,426 INFO L175 Difference]: Start difference. First operand has 81 places, 94 transitions, 701 flow. Second operand 10 states and 200 transitions. [2024-06-04 16:33:33,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 142 transitions, 1216 flow [2024-06-04 16:33:33,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 142 transitions, 1190 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 16:33:33,439 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 870 flow [2024-06-04 16:33:33,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=870, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2024-06-04 16:33:33,440 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2024-06-04 16:33:33,440 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 870 flow [2024-06-04 16:33:33,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:33,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:33,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:33,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:33:33,440 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:33:33,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash -811011618, now seen corresponding path program 2 times [2024-06-04 16:33:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:33,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102322979] [2024-06-04 16:33:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:44,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102322979] [2024-06-04 16:33:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102322979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:33:44,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455575030] [2024-06-04 16:33:44,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:44,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:33:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:44,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:33:44,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:33:44,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:33:44,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 870 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:44,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:44,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:33:44,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:45,433 INFO L124 PetriNetUnfolderBase]: 1801/2794 cut-off events. [2024-06-04 16:33:45,433 INFO L125 PetriNetUnfolderBase]: For 24783/24787 co-relation queries the response was YES. [2024-06-04 16:33:45,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12962 conditions, 2794 events. 1801/2794 cut-off events. For 24783/24787 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14117 event pairs, 528 based on Foata normal form. 12/2804 useless extension candidates. Maximal degree in co-relation 12924. Up to 2296 conditions per place. [2024-06-04 16:33:45,446 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 76 selfloop transitions, 60 changer transitions 0/141 dead transitions. [2024-06-04 16:33:45,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 141 transitions, 1343 flow [2024-06-04 16:33:45,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-04 16:33:45,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702842377260982 [2024-06-04 16:33:45,449 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 870 flow. Second operand 9 states and 182 transitions. [2024-06-04 16:33:45,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 141 transitions, 1343 flow [2024-06-04 16:33:45,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 141 transitions, 1223 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 16:33:45,468 INFO L231 Difference]: Finished difference. Result has 90 places, 103 transitions, 922 flow [2024-06-04 16:33:45,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=922, PETRI_PLACES=90, PETRI_TRANSITIONS=103} [2024-06-04 16:33:45,469 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places. [2024-06-04 16:33:45,469 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 103 transitions, 922 flow [2024-06-04 16:33:45,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:45,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:45,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:45,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:33:45,470 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:33:45,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash 274499630, now seen corresponding path program 3 times [2024-06-04 16:33:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:45,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560086084] [2024-06-04 16:33:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:56,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:56,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560086084] [2024-06-04 16:33:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560086084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:56,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:56,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406831360] [2024-06-04 16:33:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:56,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:56,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:56,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:33:56,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 103 transitions, 922 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:56,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:56,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:33:56,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:57,908 INFO L124 PetriNetUnfolderBase]: 1823/2838 cut-off events. [2024-06-04 16:33:57,908 INFO L125 PetriNetUnfolderBase]: For 27953/27966 co-relation queries the response was YES. [2024-06-04 16:33:57,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13392 conditions, 2838 events. 1823/2838 cut-off events. For 27953/27966 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14408 event pairs, 533 based on Foata normal form. 14/2848 useless extension candidates. Maximal degree in co-relation 13353. Up to 2315 conditions per place. [2024-06-04 16:33:57,922 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 76 selfloop transitions, 62 changer transitions 0/143 dead transitions. [2024-06-04 16:33:57,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 143 transitions, 1402 flow [2024-06-04 16:33:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-04 16:33:57,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702842377260982 [2024-06-04 16:33:57,924 INFO L175 Difference]: Start difference. First operand has 90 places, 103 transitions, 922 flow. Second operand 9 states and 182 transitions. [2024-06-04 16:33:57,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 143 transitions, 1402 flow [2024-06-04 16:33:57,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 143 transitions, 1260 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 16:33:57,944 INFO L231 Difference]: Finished difference. Result has 92 places, 106 transitions, 956 flow [2024-06-04 16:33:57,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=956, PETRI_PLACES=92, PETRI_TRANSITIONS=106} [2024-06-04 16:33:57,945 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2024-06-04 16:33:57,945 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 106 transitions, 956 flow [2024-06-04 16:33:57,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:57,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:57,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:33:57,946 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:33:57,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1019875732, now seen corresponding path program 4 times [2024-06-04 16:33:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747719193] [2024-06-04 16:33:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:09,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:09,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747719193] [2024-06-04 16:34:09,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747719193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:09,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:09,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:34:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622047545] [2024-06-04 16:34:09,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:09,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:34:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:09,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:34:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:34:09,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:34:09,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 106 transitions, 956 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:09,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:09,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:34:09,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:10,496 INFO L124 PetriNetUnfolderBase]: 1813/2824 cut-off events. [2024-06-04 16:34:10,497 INFO L125 PetriNetUnfolderBase]: For 30370/30383 co-relation queries the response was YES. [2024-06-04 16:34:10,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13441 conditions, 2824 events. 1813/2824 cut-off events. For 30370/30383 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14347 event pairs, 533 based on Foata normal form. 14/2834 useless extension candidates. Maximal degree in co-relation 13401. Up to 2307 conditions per place. [2024-06-04 16:34:10,511 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 76 selfloop transitions, 64 changer transitions 0/145 dead transitions. [2024-06-04 16:34:10,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 145 transitions, 1350 flow [2024-06-04 16:34:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:34:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:34:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-06-04 16:34:10,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45813953488372094 [2024-06-04 16:34:10,514 INFO L175 Difference]: Start difference. First operand has 92 places, 106 transitions, 956 flow. Second operand 10 states and 197 transitions. [2024-06-04 16:34:10,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 145 transitions, 1350 flow [2024-06-04 16:34:10,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 145 transitions, 1229 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 16:34:10,540 INFO L231 Difference]: Finished difference. Result has 96 places, 106 transitions, 971 flow [2024-06-04 16:34:10,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=971, PETRI_PLACES=96, PETRI_TRANSITIONS=106} [2024-06-04 16:34:10,541 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2024-06-04 16:34:10,541 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 971 flow [2024-06-04 16:34:10,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:10,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:10,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:10,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:34:10,542 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:34:10,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash 392732483, now seen corresponding path program 1 times [2024-06-04 16:34:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:10,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032038659] [2024-06-04 16:34:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:19,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:19,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032038659] [2024-06-04 16:34:19,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032038659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:19,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:19,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:34:19,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406463776] [2024-06-04 16:34:19,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:34:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:19,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:34:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:34:19,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:34:19,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 971 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:19,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:19,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:34:19,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:20,498 INFO L124 PetriNetUnfolderBase]: 1598/2579 cut-off events. [2024-06-04 16:34:20,498 INFO L125 PetriNetUnfolderBase]: For 28825/28825 co-relation queries the response was YES. [2024-06-04 16:34:20,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12265 conditions, 2579 events. 1598/2579 cut-off events. For 28825/28825 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 13448 event pairs, 510 based on Foata normal form. 4/2581 useless extension candidates. Maximal degree in co-relation 12224. Up to 2335 conditions per place. [2024-06-04 16:34:20,511 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 113 selfloop transitions, 16 changer transitions 0/135 dead transitions. [2024-06-04 16:34:20,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 135 transitions, 1344 flow [2024-06-04 16:34:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:34:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:34:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-04 16:34:20,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2024-06-04 16:34:20,514 INFO L175 Difference]: Start difference. First operand has 96 places, 106 transitions, 971 flow. Second operand 8 states and 155 transitions. [2024-06-04 16:34:20,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 135 transitions, 1344 flow [2024-06-04 16:34:20,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 135 transitions, 1119 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-04 16:34:20,535 INFO L231 Difference]: Finished difference. Result has 94 places, 111 transitions, 838 flow [2024-06-04 16:34:20,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=838, PETRI_PLACES=94, PETRI_TRANSITIONS=111} [2024-06-04 16:34:20,536 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2024-06-04 16:34:20,536 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 111 transitions, 838 flow [2024-06-04 16:34:20,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:20,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:20,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:20,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:34:20,536 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:34:20,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1814028228, now seen corresponding path program 1 times [2024-06-04 16:34:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535511237] [2024-06-04 16:34:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:31,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535511237] [2024-06-04 16:34:31,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535511237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:31,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:31,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:34:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140250681] [2024-06-04 16:34:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:31,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:34:31,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:31,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:34:31,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:34:32,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-04 16:34:32,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 111 transitions, 838 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:32,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:32,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-04 16:34:32,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:32,921 INFO L124 PetriNetUnfolderBase]: 1491/2467 cut-off events. [2024-06-04 16:34:32,921 INFO L125 PetriNetUnfolderBase]: For 29717/29727 co-relation queries the response was YES. [2024-06-04 16:34:32,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11734 conditions, 2467 events. 1491/2467 cut-off events. For 29717/29727 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13298 event pairs, 491 based on Foata normal form. 11/2467 useless extension candidates. Maximal degree in co-relation 11691. Up to 2186 conditions per place. [2024-06-04 16:34:32,933 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 99 selfloop transitions, 11 changer transitions 0/123 dead transitions. [2024-06-04 16:34:32,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 123 transitions, 1110 flow [2024-06-04 16:34:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:34:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:34:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-04 16:34:32,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2024-06-04 16:34:32,934 INFO L175 Difference]: Start difference. First operand has 94 places, 111 transitions, 838 flow. Second operand 6 states and 117 transitions. [2024-06-04 16:34:32,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 123 transitions, 1110 flow [2024-06-04 16:34:32,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 123 transitions, 1063 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 16:34:32,953 INFO L231 Difference]: Finished difference. Result has 95 places, 114 transitions, 851 flow [2024-06-04 16:34:32,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=95, PETRI_TRANSITIONS=114} [2024-06-04 16:34:32,953 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2024-06-04 16:34:32,953 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 114 transitions, 851 flow [2024-06-04 16:34:32,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:32,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:32,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:32,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:34:32,954 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:34:32,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash 510291889, now seen corresponding path program 1 times [2024-06-04 16:34:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408478782] [2024-06-04 16:34:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408478782] [2024-06-04 16:34:43,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408478782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:43,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:43,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:34:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391127472] [2024-06-04 16:34:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:43,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:34:43,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:34:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:34:43,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:34:43,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 114 transitions, 851 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:43,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:43,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:34:43,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:45,159 INFO L124 PetriNetUnfolderBase]: 1816/2830 cut-off events. [2024-06-04 16:34:45,160 INFO L125 PetriNetUnfolderBase]: For 38598/38602 co-relation queries the response was YES. [2024-06-04 16:34:45,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14020 conditions, 2830 events. 1816/2830 cut-off events. For 38598/38602 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14334 event pairs, 395 based on Foata normal form. 8/2836 useless extension candidates. Maximal degree in co-relation 13976. Up to 2462 conditions per place. [2024-06-04 16:34:45,173 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 115 selfloop transitions, 34 changer transitions 0/154 dead transitions. [2024-06-04 16:34:45,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 154 transitions, 1367 flow [2024-06-04 16:34:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-04 16:34:45,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45478036175710596 [2024-06-04 16:34:45,174 INFO L175 Difference]: Start difference. First operand has 95 places, 114 transitions, 851 flow. Second operand 9 states and 176 transitions. [2024-06-04 16:34:45,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 154 transitions, 1367 flow [2024-06-04 16:34:45,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 154 transitions, 1329 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 16:34:45,196 INFO L231 Difference]: Finished difference. Result has 100 places, 118 transitions, 936 flow [2024-06-04 16:34:45,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=936, PETRI_PLACES=100, PETRI_TRANSITIONS=118} [2024-06-04 16:34:45,196 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2024-06-04 16:34:45,197 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 118 transitions, 936 flow [2024-06-04 16:34:45,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:45,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:45,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:45,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:34:45,197 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:34:45,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:45,197 INFO L85 PathProgramCache]: Analyzing trace with hash 513148849, now seen corresponding path program 2 times [2024-06-04 16:34:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:45,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209962257] [2024-06-04 16:34:45,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:45,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209962257] [2024-06-04 16:34:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209962257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:34:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80448688] [2024-06-04 16:34:56,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:56,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:34:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:56,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:34:56,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:34:56,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:34:56,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 118 transitions, 936 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:56,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:56,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:34:56,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:57,403 INFO L124 PetriNetUnfolderBase]: 1808/2818 cut-off events. [2024-06-04 16:34:57,404 INFO L125 PetriNetUnfolderBase]: For 42234/42238 co-relation queries the response was YES. [2024-06-04 16:34:57,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14377 conditions, 2818 events. 1808/2818 cut-off events. For 42234/42238 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14259 event pairs, 534 based on Foata normal form. 8/2824 useless extension candidates. Maximal degree in co-relation 14332. Up to 2538 conditions per place. [2024-06-04 16:34:57,419 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 113 selfloop transitions, 33 changer transitions 0/151 dead transitions. [2024-06-04 16:34:57,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 151 transitions, 1328 flow [2024-06-04 16:34:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-04 16:34:57,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-04 16:34:57,421 INFO L175 Difference]: Start difference. First operand has 100 places, 118 transitions, 936 flow. Second operand 9 states and 174 transitions. [2024-06-04 16:34:57,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 151 transitions, 1328 flow [2024-06-04 16:34:57,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 151 transitions, 1261 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-04 16:34:57,440 INFO L231 Difference]: Finished difference. Result has 104 places, 118 transitions, 943 flow [2024-06-04 16:34:57,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=943, PETRI_PLACES=104, PETRI_TRANSITIONS=118} [2024-06-04 16:34:57,440 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2024-06-04 16:34:57,440 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 118 transitions, 943 flow [2024-06-04 16:34:57,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:57,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:57,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:57,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:34:57,441 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:34:57,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash 387906698, now seen corresponding path program 1 times [2024-06-04 16:34:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:57,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283177194] [2024-06-04 16:34:57,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:07,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:07,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283177194] [2024-06-04 16:35:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283177194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:07,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:07,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:35:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7320943] [2024-06-04 16:35:07,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:07,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:35:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:07,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:35:07,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:35:07,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:35:07,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 118 transitions, 943 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:07,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:07,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:35:07,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:08,665 INFO L124 PetriNetUnfolderBase]: 1693/2705 cut-off events. [2024-06-04 16:35:08,666 INFO L125 PetriNetUnfolderBase]: For 45543/45547 co-relation queries the response was YES. [2024-06-04 16:35:08,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14100 conditions, 2705 events. 1693/2705 cut-off events. For 45543/45547 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14126 event pairs, 528 based on Foata normal form. 5/2708 useless extension candidates. Maximal degree in co-relation 14053. Up to 2461 conditions per place. [2024-06-04 16:35:08,681 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 107 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2024-06-04 16:35:08,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 135 transitions, 1253 flow [2024-06-04 16:35:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:35:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:35:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-04 16:35:08,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2024-06-04 16:35:08,682 INFO L175 Difference]: Start difference. First operand has 104 places, 118 transitions, 943 flow. Second operand 6 states and 118 transitions. [2024-06-04 16:35:08,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 135 transitions, 1253 flow [2024-06-04 16:35:08,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 135 transitions, 1178 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 16:35:08,704 INFO L231 Difference]: Finished difference. Result has 102 places, 121 transitions, 935 flow [2024-06-04 16:35:08,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=102, PETRI_TRANSITIONS=121} [2024-06-04 16:35:08,705 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 58 predicate places. [2024-06-04 16:35:08,705 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 121 transitions, 935 flow [2024-06-04 16:35:08,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:08,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:08,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:08,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:35:08,705 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:35:08,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 400286858, now seen corresponding path program 2 times [2024-06-04 16:35:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639398547] [2024-06-04 16:35:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:18,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:18,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639398547] [2024-06-04 16:35:18,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639398547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:18,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:18,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:35:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541583171] [2024-06-04 16:35:18,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:18,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:35:18,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:18,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:35:18,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:35:19,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:35:19,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 121 transitions, 935 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:19,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:19,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:35:19,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:19,979 INFO L124 PetriNetUnfolderBase]: 1690/2703 cut-off events. [2024-06-04 16:35:19,979 INFO L125 PetriNetUnfolderBase]: For 49378/49391 co-relation queries the response was YES. [2024-06-04 16:35:19,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14391 conditions, 2703 events. 1690/2703 cut-off events. For 49378/49391 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14191 event pairs, 533 based on Foata normal form. 11/2710 useless extension candidates. Maximal degree in co-relation 14343. Up to 2451 conditions per place. [2024-06-04 16:35:19,995 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 100 selfloop transitions, 19 changer transitions 0/133 dead transitions. [2024-06-04 16:35:19,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 133 transitions, 1231 flow [2024-06-04 16:35:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:35:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:35:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-04 16:35:19,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-04 16:35:19,997 INFO L175 Difference]: Start difference. First operand has 102 places, 121 transitions, 935 flow. Second operand 6 states and 114 transitions. [2024-06-04 16:35:19,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 133 transitions, 1231 flow [2024-06-04 16:35:20,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 133 transitions, 1188 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 16:35:20,021 INFO L231 Difference]: Finished difference. Result has 104 places, 124 transitions, 974 flow [2024-06-04 16:35:20,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=974, PETRI_PLACES=104, PETRI_TRANSITIONS=124} [2024-06-04 16:35:20,022 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2024-06-04 16:35:20,022 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 124 transitions, 974 flow [2024-06-04 16:35:20,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:20,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:20,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:20,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:35:20,022 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:35:20,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 954168260, now seen corresponding path program 1 times [2024-06-04 16:35:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756557483] [2024-06-04 16:35:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:30,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:30,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756557483] [2024-06-04 16:35:30,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756557483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:30,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:30,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:35:30,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874162268] [2024-06-04 16:35:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:30,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:35:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:35:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:35:31,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:35:31,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 124 transitions, 974 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-06-04 16:35:31,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:31,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:35:31,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:31,975 INFO L124 PetriNetUnfolderBase]: 1611/2603 cut-off events. [2024-06-04 16:35:31,975 INFO L125 PetriNetUnfolderBase]: For 45633/45633 co-relation queries the response was YES. [2024-06-04 16:35:31,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13899 conditions, 2603 events. 1611/2603 cut-off events. For 45633/45633 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13635 event pairs, 489 based on Foata normal form. 1/2602 useless extension candidates. Maximal degree in co-relation 13850. Up to 2389 conditions per place. [2024-06-04 16:35:31,990 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 122 selfloop transitions, 11 changer transitions 0/139 dead transitions. [2024-06-04 16:35:31,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 139 transitions, 1306 flow [2024-06-04 16:35:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:35:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:35:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-04 16:35:31,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44573643410852715 [2024-06-04 16:35:31,991 INFO L175 Difference]: Start difference. First operand has 104 places, 124 transitions, 974 flow. Second operand 6 states and 115 transitions. [2024-06-04 16:35:31,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 139 transitions, 1306 flow [2024-06-04 16:35:32,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 139 transitions, 1246 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-04 16:35:32,018 INFO L231 Difference]: Finished difference. Result has 106 places, 127 transitions, 978 flow [2024-06-04 16:35:32,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=978, PETRI_PLACES=106, PETRI_TRANSITIONS=127} [2024-06-04 16:35:32,018 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places. [2024-06-04 16:35:32,018 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 127 transitions, 978 flow [2024-06-04 16:35:32,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-06-04 16:35:32,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:32,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:32,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:35:32,019 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:35:32,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash 400292810, now seen corresponding path program 2 times [2024-06-04 16:35:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:32,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524362584] [2024-06-04 16:35:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524362584] [2024-06-04 16:35:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524362584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:42,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:35:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256320475] [2024-06-04 16:35:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:42,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:35:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:35:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:35:42,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:35:42,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 127 transitions, 978 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-06-04 16:35:42,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:42,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:35:42,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:43,529 INFO L124 PetriNetUnfolderBase]: 1608/2599 cut-off events. [2024-06-04 16:35:43,529 INFO L125 PetriNetUnfolderBase]: For 48540/48540 co-relation queries the response was YES. [2024-06-04 16:35:43,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14218 conditions, 2599 events. 1608/2599 cut-off events. For 48540/48540 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13640 event pairs, 489 based on Foata normal form. 1/2598 useless extension candidates. Maximal degree in co-relation 14168. Up to 2379 conditions per place. [2024-06-04 16:35:43,545 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 120 selfloop transitions, 17 changer transitions 0/143 dead transitions. [2024-06-04 16:35:43,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 143 transitions, 1326 flow [2024-06-04 16:35:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:35:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:35:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 16:35:43,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-04 16:35:43,546 INFO L175 Difference]: Start difference. First operand has 106 places, 127 transitions, 978 flow. Second operand 7 states and 131 transitions. [2024-06-04 16:35:43,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 143 transitions, 1326 flow [2024-06-04 16:35:43,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 143 transitions, 1284 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 16:35:43,570 INFO L231 Difference]: Finished difference. Result has 109 places, 130 transitions, 1018 flow [2024-06-04 16:35:43,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1018, PETRI_PLACES=109, PETRI_TRANSITIONS=130} [2024-06-04 16:35:43,570 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 65 predicate places. [2024-06-04 16:35:43,570 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 130 transitions, 1018 flow [2024-06-04 16:35:43,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 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-06-04 16:35:43,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:43,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:35:43,571 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:35:43,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1980570455, now seen corresponding path program 1 times [2024-06-04 16:35:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:43,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513475403] [2024-06-04 16:35:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:55,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-06-04 16:35:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513475403] [2024-06-04 16:35:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513475403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:55,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:55,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:35:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542376407] [2024-06-04 16:35:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:55,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:35:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:35:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:35:55,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:35:55,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 130 transitions, 1018 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:55,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:55,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:35:55,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:56,937 INFO L124 PetriNetUnfolderBase]: 1956/3074 cut-off events. [2024-06-04 16:35:56,937 INFO L125 PetriNetUnfolderBase]: For 71963/71967 co-relation queries the response was YES. [2024-06-04 16:35:56,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17609 conditions, 3074 events. 1956/3074 cut-off events. For 71963/71967 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16009 event pairs, 349 based on Foata normal form. 20/3092 useless extension candidates. Maximal degree in co-relation 17558. Up to 2007 conditions per place. [2024-06-04 16:35:56,956 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 115 selfloop transitions, 62 changer transitions 0/182 dead transitions. [2024-06-04 16:35:56,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 182 transitions, 1658 flow [2024-06-04 16:35:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-04 16:35:56,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744186046511628 [2024-06-04 16:35:56,958 INFO L175 Difference]: Start difference. First operand has 109 places, 130 transitions, 1018 flow. Second operand 10 states and 204 transitions. [2024-06-04 16:35:56,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 182 transitions, 1658 flow [2024-06-04 16:35:56,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 182 transitions, 1598 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 16:35:56,989 INFO L231 Difference]: Finished difference. Result has 114 places, 132 transitions, 1126 flow [2024-06-04 16:35:56,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1126, PETRI_PLACES=114, PETRI_TRANSITIONS=132} [2024-06-04 16:35:56,990 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places. [2024-06-04 16:35:56,990 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 132 transitions, 1126 flow [2024-06-04 16:35:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:56,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:56,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:56,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:35:56,990 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:35:56,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1976761175, now seen corresponding path program 2 times [2024-06-04 16:35:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591302534] [2024-06-04 16:35:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:08,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591302534] [2024-06-04 16:36:08,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591302534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:08,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:08,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:36:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102483989] [2024-06-04 16:36:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:08,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:36:08,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:08,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:36:08,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:36:08,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:36:08,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 132 transitions, 1126 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:08,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:08,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:36:08,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:09,636 INFO L124 PetriNetUnfolderBase]: 2048/3236 cut-off events. [2024-06-04 16:36:09,636 INFO L125 PetriNetUnfolderBase]: For 80347/80351 co-relation queries the response was YES. [2024-06-04 16:36:09,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18855 conditions, 3236 events. 2048/3236 cut-off events. For 80347/80351 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17211 event pairs, 540 based on Foata normal form. 28/3262 useless extension candidates. Maximal degree in co-relation 18803. Up to 2542 conditions per place. [2024-06-04 16:36:09,659 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 107 selfloop transitions, 65 changer transitions 0/177 dead transitions. [2024-06-04 16:36:09,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 177 transitions, 1640 flow [2024-06-04 16:36:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-06-04 16:36:09,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46744186046511627 [2024-06-04 16:36:09,660 INFO L175 Difference]: Start difference. First operand has 114 places, 132 transitions, 1126 flow. Second operand 10 states and 201 transitions. [2024-06-04 16:36:09,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 177 transitions, 1640 flow [2024-06-04 16:36:09,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 177 transitions, 1560 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:36:09,746 INFO L231 Difference]: Finished difference. Result has 118 places, 134 transitions, 1222 flow [2024-06-04 16:36:09,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1222, PETRI_PLACES=118, PETRI_TRANSITIONS=134} [2024-06-04 16:36:09,746 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 74 predicate places. [2024-06-04 16:36:09,746 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 134 transitions, 1222 flow [2024-06-04 16:36:09,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:09,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:09,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:09,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:36:09,747 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:36:09,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:09,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1976909045, now seen corresponding path program 3 times [2024-06-04 16:36:09,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:09,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749710932] [2024-06-04 16:36:09,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:09,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:20,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749710932] [2024-06-04 16:36:20,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749710932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:20,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:20,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:36:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396703319] [2024-06-04 16:36:20,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:20,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:36:20,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:36:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:36:20,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:36:20,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 134 transitions, 1222 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:20,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:20,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:36:20,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:22,299 INFO L124 PetriNetUnfolderBase]: 2106/3339 cut-off events. [2024-06-04 16:36:22,300 INFO L125 PetriNetUnfolderBase]: For 85819/85823 co-relation queries the response was YES. [2024-06-04 16:36:22,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19935 conditions, 3339 events. 2106/3339 cut-off events. For 85819/85823 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17974 event pairs, 535 based on Foata normal form. 20/3357 useless extension candidates. Maximal degree in co-relation 19881. Up to 2525 conditions per place. [2024-06-04 16:36:22,319 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 111 selfloop transitions, 66 changer transitions 0/182 dead transitions. [2024-06-04 16:36:22,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 182 transitions, 1750 flow [2024-06-04 16:36:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions. [2024-06-04 16:36:22,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744186046511628 [2024-06-04 16:36:22,322 INFO L175 Difference]: Start difference. First operand has 118 places, 134 transitions, 1222 flow. Second operand 10 states and 204 transitions. [2024-06-04 16:36:22,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 182 transitions, 1750 flow [2024-06-04 16:36:22,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 182 transitions, 1606 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 16:36:22,372 INFO L231 Difference]: Finished difference. Result has 120 places, 135 transitions, 1240 flow [2024-06-04 16:36:22,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1240, PETRI_PLACES=120, PETRI_TRANSITIONS=135} [2024-06-04 16:36:22,372 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places. [2024-06-04 16:36:22,373 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 135 transitions, 1240 flow [2024-06-04 16:36:22,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:22,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:22,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:22,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:36:22,373 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:36:22,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash -860121456, now seen corresponding path program 1 times [2024-06-04 16:36:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:22,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026745832] [2024-06-04 16:36:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:22,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:32,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:32,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026745832] [2024-06-04 16:36:32,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026745832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:32,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:32,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:36:32,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152251473] [2024-06-04 16:36:32,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:32,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:36:32,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:32,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:36:32,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:36:32,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:36:32,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 135 transitions, 1240 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:32,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:32,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:36:32,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:34,028 INFO L124 PetriNetUnfolderBase]: 2116/3360 cut-off events. [2024-06-04 16:36:34,028 INFO L125 PetriNetUnfolderBase]: For 87536/87540 co-relation queries the response was YES. [2024-06-04 16:36:34,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20172 conditions, 3360 events. 2116/3360 cut-off events. For 87536/87540 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18090 event pairs, 619 based on Foata normal form. 6/3364 useless extension candidates. Maximal degree in co-relation 20117. Up to 3061 conditions per place. [2024-06-04 16:36:34,050 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 127 selfloop transitions, 36 changer transitions 0/168 dead transitions. [2024-06-04 16:36:34,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 168 transitions, 1702 flow [2024-06-04 16:36:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-04 16:36:34,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-04 16:36:34,051 INFO L175 Difference]: Start difference. First operand has 120 places, 135 transitions, 1240 flow. Second operand 9 states and 170 transitions. [2024-06-04 16:36:34,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 168 transitions, 1702 flow [2024-06-04 16:36:34,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 168 transitions, 1558 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 16:36:34,098 INFO L231 Difference]: Finished difference. Result has 121 places, 139 transitions, 1232 flow [2024-06-04 16:36:34,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1232, PETRI_PLACES=121, PETRI_TRANSITIONS=139} [2024-06-04 16:36:34,099 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2024-06-04 16:36:34,099 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 139 transitions, 1232 flow [2024-06-04 16:36:34,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:34,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:34,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:34,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:36:34,100 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:36:34,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1993194561, now seen corresponding path program 4 times [2024-06-04 16:36:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:34,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389100835] [2024-06-04 16:36:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:45,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389100835] [2024-06-04 16:36:45,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389100835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:45,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:45,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:36:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862988871] [2024-06-04 16:36:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:45,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:36:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:45,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:36:45,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:36:45,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:36:45,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 139 transitions, 1232 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:45,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:45,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:36:45,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:46,780 INFO L124 PetriNetUnfolderBase]: 2235/3571 cut-off events. [2024-06-04 16:36:46,780 INFO L125 PetriNetUnfolderBase]: For 101707/101711 co-relation queries the response was YES. [2024-06-04 16:36:46,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21630 conditions, 3571 events. 2235/3571 cut-off events. For 101707/101711 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19694 event pairs, 435 based on Foata normal form. 20/3589 useless extension candidates. Maximal degree in co-relation 21574. Up to 2621 conditions per place. [2024-06-04 16:36:46,801 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 116 selfloop transitions, 69 changer transitions 0/190 dead transitions. [2024-06-04 16:36:46,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 190 transitions, 1906 flow [2024-06-04 16:36:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-06-04 16:36:46,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47674418604651164 [2024-06-04 16:36:46,804 INFO L175 Difference]: Start difference. First operand has 121 places, 139 transitions, 1232 flow. Second operand 10 states and 205 transitions. [2024-06-04 16:36:46,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 190 transitions, 1906 flow [2024-06-04 16:36:46,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 190 transitions, 1800 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-04 16:36:46,856 INFO L231 Difference]: Finished difference. Result has 124 places, 141 transitions, 1320 flow [2024-06-04 16:36:46,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1320, PETRI_PLACES=124, PETRI_TRANSITIONS=141} [2024-06-04 16:36:46,857 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places. [2024-06-04 16:36:46,857 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 141 transitions, 1320 flow [2024-06-04 16:36:46,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:46,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:46,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:46,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 16:36:46,857 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:36:46,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1987684311, now seen corresponding path program 5 times [2024-06-04 16:36:46,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:46,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973313528] [2024-06-04 16:36:46,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:58,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:58,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973313528] [2024-06-04 16:36:58,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973313528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:58,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:58,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:58,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591808367] [2024-06-04 16:36:58,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:58,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:58,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:58,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:58,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:36:58,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 141 transitions, 1320 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:58,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:58,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:36:58,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:00,501 INFO L124 PetriNetUnfolderBase]: 2310/3691 cut-off events. [2024-06-04 16:37:00,502 INFO L125 PetriNetUnfolderBase]: For 112098/112102 co-relation queries the response was YES. [2024-06-04 16:37:00,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22696 conditions, 3691 events. 2310/3691 cut-off events. For 112098/112102 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20586 event pairs, 603 based on Foata normal form. 24/3713 useless extension candidates. Maximal degree in co-relation 22639. Up to 3003 conditions per place. [2024-06-04 16:37:00,527 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 121 selfloop transitions, 64 changer transitions 0/190 dead transitions. [2024-06-04 16:37:00,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 190 transitions, 1872 flow [2024-06-04 16:37:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:37:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:37:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions. [2024-06-04 16:37:00,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608879492600423 [2024-06-04 16:37:00,529 INFO L175 Difference]: Start difference. First operand has 124 places, 141 transitions, 1320 flow. Second operand 11 states and 218 transitions. [2024-06-04 16:37:00,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 190 transitions, 1872 flow [2024-06-04 16:37:00,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 190 transitions, 1773 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 16:37:00,600 INFO L231 Difference]: Finished difference. Result has 129 places, 142 transitions, 1386 flow [2024-06-04 16:37:00,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1386, PETRI_PLACES=129, PETRI_TRANSITIONS=142} [2024-06-04 16:37:00,601 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places. [2024-06-04 16:37:00,601 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 142 transitions, 1386 flow [2024-06-04 16:37:00,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:00,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:00,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:00,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 16:37:00,602 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:37:00,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash -754788691, now seen corresponding path program 6 times [2024-06-04 16:37:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147047281] [2024-06-04 16:37:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:00,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:11,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147047281] [2024-06-04 16:37:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147047281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:37:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722816550] [2024-06-04 16:37:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:11,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:37:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:11,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:37:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:37:11,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:37:11,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 142 transitions, 1386 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:11,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:11,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:37:11,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:13,449 INFO L124 PetriNetUnfolderBase]: 2385/3816 cut-off events. [2024-06-04 16:37:13,449 INFO L125 PetriNetUnfolderBase]: For 120091/120095 co-relation queries the response was YES. [2024-06-04 16:37:13,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23719 conditions, 3816 events. 2385/3816 cut-off events. For 120091/120095 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21515 event pairs, 608 based on Foata normal form. 24/3838 useless extension candidates. Maximal degree in co-relation 23660. Up to 3128 conditions per place. [2024-06-04 16:37:13,473 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 116 selfloop transitions, 66 changer transitions 0/187 dead transitions. [2024-06-04 16:37:13,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 187 transitions, 1922 flow [2024-06-04 16:37:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions. [2024-06-04 16:37:13,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-04 16:37:13,476 INFO L175 Difference]: Start difference. First operand has 129 places, 142 transitions, 1386 flow. Second operand 10 states and 200 transitions. [2024-06-04 16:37:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 187 transitions, 1922 flow [2024-06-04 16:37:13,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 187 transitions, 1785 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 16:37:13,546 INFO L231 Difference]: Finished difference. Result has 130 places, 143 transitions, 1420 flow [2024-06-04 16:37:13,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1420, PETRI_PLACES=130, PETRI_TRANSITIONS=143} [2024-06-04 16:37:13,546 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 86 predicate places. [2024-06-04 16:37:13,546 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 143 transitions, 1420 flow [2024-06-04 16:37:13,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:13,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:13,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:13,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 16:37:13,547 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:37:13,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash -859792763, now seen corresponding path program 1 times [2024-06-04 16:37:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068907076] [2024-06-04 16:37:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:26,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:26,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068907076] [2024-06-04 16:37:26,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068907076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:26,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:26,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:37:26,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132228435] [2024-06-04 16:37:26,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:26,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:37:26,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:26,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:37:26,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:37:26,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:37:26,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 143 transitions, 1420 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:26,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:26,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:37:26,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:27,401 INFO L124 PetriNetUnfolderBase]: 2264/3692 cut-off events. [2024-06-04 16:37:27,402 INFO L125 PetriNetUnfolderBase]: For 118749/118753 co-relation queries the response was YES. [2024-06-04 16:37:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23179 conditions, 3692 events. 2264/3692 cut-off events. For 118749/118753 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 21417 event pairs, 692 based on Foata normal form. 5/3671 useless extension candidates. Maximal degree in co-relation 23119. Up to 3390 conditions per place. [2024-06-04 16:37:27,426 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 127 selfloop transitions, 17 changer transitions 0/161 dead transitions. [2024-06-04 16:37:27,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 161 transitions, 1788 flow [2024-06-04 16:37:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:37:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:37:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 16:37:27,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-04 16:37:27,427 INFO L175 Difference]: Start difference. First operand has 130 places, 143 transitions, 1420 flow. Second operand 7 states and 133 transitions. [2024-06-04 16:37:27,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 161 transitions, 1788 flow [2024-06-04 16:37:27,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 161 transitions, 1645 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 16:37:27,500 INFO L231 Difference]: Finished difference. Result has 129 places, 146 transitions, 1359 flow [2024-06-04 16:37:27,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1359, PETRI_PLACES=129, PETRI_TRANSITIONS=146} [2024-06-04 16:37:27,501 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places. [2024-06-04 16:37:27,501 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 146 transitions, 1359 flow [2024-06-04 16:37:27,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:27,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:27,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:27,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 16:37:27,501 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:37:27,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash -859793166, now seen corresponding path program 2 times [2024-06-04 16:37:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:27,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352574914] [2024-06-04 16:37:27,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352574914] [2024-06-04 16:37:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352574914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:38,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:38,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:37:38,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199385895] [2024-06-04 16:37:38,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:38,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:37:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:38,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:37:38,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:37:38,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:37:38,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 146 transitions, 1359 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:38,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:38,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:37:38,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:39,737 INFO L124 PetriNetUnfolderBase]: 2418/3884 cut-off events. [2024-06-04 16:37:39,737 INFO L125 PetriNetUnfolderBase]: For 124288/124292 co-relation queries the response was YES. [2024-06-04 16:37:39,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24324 conditions, 3884 events. 2418/3884 cut-off events. For 124288/124292 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22057 event pairs, 706 based on Foata normal form. 6/3888 useless extension candidates. Maximal degree in co-relation 24263. Up to 3526 conditions per place. [2024-06-04 16:37:39,761 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 136 selfloop transitions, 40 changer transitions 0/181 dead transitions. [2024-06-04 16:37:39,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 181 transitions, 1965 flow [2024-06-04 16:37:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:37:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:37:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-04 16:37:39,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-04 16:37:39,762 INFO L175 Difference]: Start difference. First operand has 129 places, 146 transitions, 1359 flow. Second operand 9 states and 170 transitions. [2024-06-04 16:37:39,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 181 transitions, 1965 flow [2024-06-04 16:37:39,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 181 transitions, 1905 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 16:37:39,824 INFO L231 Difference]: Finished difference. Result has 134 places, 154 transitions, 1524 flow [2024-06-04 16:37:39,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1524, PETRI_PLACES=134, PETRI_TRANSITIONS=154} [2024-06-04 16:37:39,824 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places. [2024-06-04 16:37:39,824 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 154 transitions, 1524 flow [2024-06-04 16:37:39,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:39,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:39,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:39,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 16:37:39,825 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:37:39,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:39,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1801177005, now seen corresponding path program 7 times [2024-06-04 16:37:39,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:39,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742981135] [2024-06-04 16:37:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:39,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742981135] [2024-06-04 16:37:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742981135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:37:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348588192] [2024-06-04 16:37:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:52,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:37:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:37:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:37:52,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:37:52,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 154 transitions, 1524 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:52,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:52,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:37:52,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:54,212 INFO L124 PetriNetUnfolderBase]: 2493/4001 cut-off events. [2024-06-04 16:37:54,213 INFO L125 PetriNetUnfolderBase]: For 143107/143120 co-relation queries the response was YES. [2024-06-04 16:37:54,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25863 conditions, 4001 events. 2493/4001 cut-off events. For 143107/143120 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22852 event pairs, 623 based on Foata normal form. 30/4027 useless extension candidates. Maximal degree in co-relation 25800. Up to 3314 conditions per place. [2024-06-04 16:37:54,243 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 129 selfloop transitions, 65 changer transitions 0/199 dead transitions. [2024-06-04 16:37:54,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 199 transitions, 2090 flow [2024-06-04 16:37:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions. [2024-06-04 16:37:54,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-04 16:37:54,246 INFO L175 Difference]: Start difference. First operand has 134 places, 154 transitions, 1524 flow. Second operand 10 states and 200 transitions. [2024-06-04 16:37:54,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 199 transitions, 2090 flow [2024-06-04 16:37:54,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 199 transitions, 1995 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-04 16:37:54,342 INFO L231 Difference]: Finished difference. Result has 139 places, 155 transitions, 1598 flow [2024-06-04 16:37:54,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1598, PETRI_PLACES=139, PETRI_TRANSITIONS=155} [2024-06-04 16:37:54,343 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places. [2024-06-04 16:37:54,343 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 155 transitions, 1598 flow [2024-06-04 16:37:54,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:54,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:54,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:54,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 16:37:54,344 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:37:54,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash -18165865, now seen corresponding path program 8 times [2024-06-04 16:37:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:54,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479736100] [2024-06-04 16:37:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:02,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:02,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479736100] [2024-06-04 16:38:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479736100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:02,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:02,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685378975] [2024-06-04 16:38:02,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:02,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:02,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:38:02,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 155 transitions, 1598 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:02,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:02,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:38:02,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:03,936 INFO L124 PetriNetUnfolderBase]: 2457/3940 cut-off events. [2024-06-04 16:38:03,937 INFO L125 PetriNetUnfolderBase]: For 142518/142531 co-relation queries the response was YES. [2024-06-04 16:38:03,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25504 conditions, 3940 events. 2457/3940 cut-off events. For 142518/142531 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22384 event pairs, 605 based on Foata normal form. 30/3966 useless extension candidates. Maximal degree in co-relation 25439. Up to 3258 conditions per place. [2024-06-04 16:38:03,965 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 131 selfloop transitions, 67 changer transitions 0/203 dead transitions. [2024-06-04 16:38:03,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 203 transitions, 2154 flow [2024-06-04 16:38:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:38:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:38:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-06-04 16:38:03,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4587737843551797 [2024-06-04 16:38:03,968 INFO L175 Difference]: Start difference. First operand has 139 places, 155 transitions, 1598 flow. Second operand 11 states and 217 transitions. [2024-06-04 16:38:03,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 203 transitions, 2154 flow [2024-06-04 16:38:04,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 203 transitions, 1999 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 16:38:04,079 INFO L231 Difference]: Finished difference. Result has 142 places, 155 transitions, 1584 flow [2024-06-04 16:38:04,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1584, PETRI_PLACES=142, PETRI_TRANSITIONS=155} [2024-06-04 16:38:04,079 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 98 predicate places. [2024-06-04 16:38:04,079 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 155 transitions, 1584 flow [2024-06-04 16:38:04,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:04,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:04,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:04,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 16:38:04,080 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:38:04,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 918893252, now seen corresponding path program 1 times [2024-06-04 16:38:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279388182] [2024-06-04 16:38:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:13,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:13,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279388182] [2024-06-04 16:38:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279388182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849029023] [2024-06-04 16:38:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:13,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:13,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:13,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:38:13,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 155 transitions, 1584 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:13,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:13,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:38:13,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:15,461 INFO L124 PetriNetUnfolderBase]: 2485/3959 cut-off events. [2024-06-04 16:38:15,461 INFO L125 PetriNetUnfolderBase]: For 140435/140435 co-relation queries the response was YES. [2024-06-04 16:38:15,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25745 conditions, 3959 events. 2485/3959 cut-off events. For 140435/140435 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22429 event pairs, 667 based on Foata normal form. 4/3941 useless extension candidates. Maximal degree in co-relation 25679. Up to 3394 conditions per place. [2024-06-04 16:38:15,488 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 115 selfloop transitions, 80 changer transitions 0/200 dead transitions. [2024-06-04 16:38:15,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 200 transitions, 2250 flow [2024-06-04 16:38:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:38:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:38:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-04 16:38:15,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45478036175710596 [2024-06-04 16:38:15,489 INFO L175 Difference]: Start difference. First operand has 142 places, 155 transitions, 1584 flow. Second operand 9 states and 176 transitions. [2024-06-04 16:38:15,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 200 transitions, 2250 flow [2024-06-04 16:38:15,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 200 transitions, 2062 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 16:38:15,587 INFO L231 Difference]: Finished difference. Result has 142 places, 171 transitions, 1774 flow [2024-06-04 16:38:15,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1774, PETRI_PLACES=142, PETRI_TRANSITIONS=171} [2024-06-04 16:38:15,588 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 98 predicate places. [2024-06-04 16:38:15,588 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 171 transitions, 1774 flow [2024-06-04 16:38:15,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:15,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:15,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:15,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 16:38:15,588 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:38:15,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash -211889794, now seen corresponding path program 2 times [2024-06-04 16:38:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075754278] [2024-06-04 16:38:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:25,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075754278] [2024-06-04 16:38:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075754278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363298804] [2024-06-04 16:38:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:25,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:25,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:25,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:38:25,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 171 transitions, 1774 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:25,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:25,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:38:25,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:27,456 INFO L124 PetriNetUnfolderBase]: 2502/3992 cut-off events. [2024-06-04 16:38:27,457 INFO L125 PetriNetUnfolderBase]: For 148410/148410 co-relation queries the response was YES. [2024-06-04 16:38:27,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26425 conditions, 3992 events. 2502/3992 cut-off events. For 148410/148410 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22647 event pairs, 667 based on Foata normal form. 4/3978 useless extension candidates. Maximal degree in co-relation 26357. Up to 3421 conditions per place. [2024-06-04 16:38:27,484 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 121 selfloop transitions, 78 changer transitions 0/204 dead transitions. [2024-06-04 16:38:27,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 204 transitions, 2324 flow [2024-06-04 16:38:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:38:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:38:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-04 16:38:27,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45478036175710596 [2024-06-04 16:38:27,489 INFO L175 Difference]: Start difference. First operand has 142 places, 171 transitions, 1774 flow. Second operand 9 states and 176 transitions. [2024-06-04 16:38:27,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 204 transitions, 2324 flow [2024-06-04 16:38:27,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 204 transitions, 2165 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-04 16:38:27,594 INFO L231 Difference]: Finished difference. Result has 148 places, 174 transitions, 1845 flow [2024-06-04 16:38:27,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1845, PETRI_PLACES=148, PETRI_TRANSITIONS=174} [2024-06-04 16:38:27,594 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 104 predicate places. [2024-06-04 16:38:27,594 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 174 transitions, 1845 flow [2024-06-04 16:38:27,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:27,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:27,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:27,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 16:38:27,595 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:38:27,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash -807194940, now seen corresponding path program 3 times [2024-06-04 16:38:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968232319] [2024-06-04 16:38:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:36,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968232319] [2024-06-04 16:38:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968232319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:36,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:36,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:36,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785017659] [2024-06-04 16:38:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:36,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:36,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:36,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:38:36,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 174 transitions, 1845 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:36,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:36,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:38:36,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:38,106 INFO L124 PetriNetUnfolderBase]: 2494/3971 cut-off events. [2024-06-04 16:38:38,106 INFO L125 PetriNetUnfolderBase]: For 154078/154078 co-relation queries the response was YES. [2024-06-04 16:38:38,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26319 conditions, 3971 events. 2494/3971 cut-off events. For 154078/154078 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22510 event pairs, 665 based on Foata normal form. 4/3951 useless extension candidates. Maximal degree in co-relation 26249. Up to 3409 conditions per place. [2024-06-04 16:38:38,134 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 121 selfloop transitions, 80 changer transitions 0/206 dead transitions. [2024-06-04 16:38:38,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 206 transitions, 2396 flow [2024-06-04 16:38:38,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:38:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:38:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-04 16:38:38,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45478036175710596 [2024-06-04 16:38:38,137 INFO L175 Difference]: Start difference. First operand has 148 places, 174 transitions, 1845 flow. Second operand 9 states and 176 transitions. [2024-06-04 16:38:38,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 206 transitions, 2396 flow [2024-06-04 16:38:38,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 206 transitions, 2201 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-04 16:38:38,273 INFO L231 Difference]: Finished difference. Result has 152 places, 177 transitions, 1892 flow [2024-06-04 16:38:38,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1892, PETRI_PLACES=152, PETRI_TRANSITIONS=177} [2024-06-04 16:38:38,273 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 108 predicate places. [2024-06-04 16:38:38,273 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 177 transitions, 1892 flow [2024-06-04 16:38:38,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:38,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:38,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 16:38:38,274 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:38:38,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash 542417254, now seen corresponding path program 4 times [2024-06-04 16:38:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229463907] [2024-06-04 16:38:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229463907] [2024-06-04 16:38:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229463907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:48,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:48,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602948569] [2024-06-04 16:38:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:48,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:48,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:48,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:48,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:38:48,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 177 transitions, 1892 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:48,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:48,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:38:48,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:50,380 INFO L124 PetriNetUnfolderBase]: 2527/4046 cut-off events. [2024-06-04 16:38:50,380 INFO L125 PetriNetUnfolderBase]: For 159543/159543 co-relation queries the response was YES. [2024-06-04 16:38:50,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26644 conditions, 4046 events. 2527/4046 cut-off events. For 159543/159543 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 23196 event pairs, 573 based on Foata normal form. 4/4030 useless extension candidates. Maximal degree in co-relation 26572. Up to 3266 conditions per place. [2024-06-04 16:38:50,413 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 117 selfloop transitions, 91 changer transitions 0/213 dead transitions. [2024-06-04 16:38:50,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 213 transitions, 2472 flow [2024-06-04 16:38:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:38:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:38:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-04 16:38:50,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-06-04 16:38:50,416 INFO L175 Difference]: Start difference. First operand has 152 places, 177 transitions, 1892 flow. Second operand 9 states and 180 transitions. [2024-06-04 16:38:50,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 213 transitions, 2472 flow [2024-06-04 16:38:50,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 213 transitions, 2267 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 16:38:50,555 INFO L231 Difference]: Finished difference. Result has 156 places, 180 transitions, 1956 flow [2024-06-04 16:38:50,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1956, PETRI_PLACES=156, PETRI_TRANSITIONS=180} [2024-06-04 16:38:50,555 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 112 predicate places. [2024-06-04 16:38:50,555 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 180 transitions, 1956 flow [2024-06-04 16:38:50,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:50,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:50,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:50,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 16:38:50,556 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:38:50,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash -476008206, now seen corresponding path program 3 times [2024-06-04 16:38:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:50,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993964131] [2024-06-04 16:38:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:01,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:01,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993964131] [2024-06-04 16:39:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993964131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:01,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:39:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100074560] [2024-06-04 16:39:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:01,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:39:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:01,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:39:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:39:01,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:39:01,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 180 transitions, 1956 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:01,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:01,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:39:01,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:02,949 INFO L124 PetriNetUnfolderBase]: 2531/4079 cut-off events. [2024-06-04 16:39:02,949 INFO L125 PetriNetUnfolderBase]: For 165348/165361 co-relation queries the response was YES. [2024-06-04 16:39:02,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27072 conditions, 4079 events. 2531/4079 cut-off events. For 165348/165361 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 23457 event pairs, 619 based on Foata normal form. 12/4087 useless extension candidates. Maximal degree in co-relation 26998. Up to 3687 conditions per place. [2024-06-04 16:39:02,984 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 149 selfloop transitions, 53 changer transitions 0/207 dead transitions. [2024-06-04 16:39:02,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 207 transitions, 2704 flow [2024-06-04 16:39:02,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:39:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:39:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-04 16:39:02,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2024-06-04 16:39:02,985 INFO L175 Difference]: Start difference. First operand has 156 places, 180 transitions, 1956 flow. Second operand 8 states and 153 transitions. [2024-06-04 16:39:02,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 207 transitions, 2704 flow [2024-06-04 16:39:03,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 207 transitions, 2503 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 16:39:03,123 INFO L231 Difference]: Finished difference. Result has 159 places, 188 transitions, 2023 flow [2024-06-04 16:39:03,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2023, PETRI_PLACES=159, PETRI_TRANSITIONS=188} [2024-06-04 16:39:03,124 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places. [2024-06-04 16:39:03,124 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 188 transitions, 2023 flow [2024-06-04 16:39:03,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:03,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:03,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:03,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 16:39:03,124 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:39:03,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash -478386387, now seen corresponding path program 2 times [2024-06-04 16:39:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169924503] [2024-06-04 16:39:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:15,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:15,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169924503] [2024-06-04 16:39:15,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169924503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:15,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:15,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:39:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218224798] [2024-06-04 16:39:15,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:15,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:39:15,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:15,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:39:15,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:39:15,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:39:15,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 188 transitions, 2023 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:15,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:15,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:39:15,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:16,503 INFO L124 PetriNetUnfolderBase]: 2420/3980 cut-off events. [2024-06-04 16:39:16,503 INFO L125 PetriNetUnfolderBase]: For 174433/174446 co-relation queries the response was YES. [2024-06-04 16:39:16,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26713 conditions, 3980 events. 2420/3980 cut-off events. For 174433/174446 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23664 event pairs, 626 based on Foata normal form. 11/3963 useless extension candidates. Maximal degree in co-relation 26637. Up to 3610 conditions per place. [2024-06-04 16:39:16,537 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 158 selfloop transitions, 22 changer transitions 0/201 dead transitions. [2024-06-04 16:39:16,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 201 transitions, 2469 flow [2024-06-04 16:39:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:39:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:39:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-04 16:39:16,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 16:39:16,538 INFO L175 Difference]: Start difference. First operand has 159 places, 188 transitions, 2023 flow. Second operand 7 states and 129 transitions. [2024-06-04 16:39:16,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 201 transitions, 2469 flow [2024-06-04 16:39:16,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 201 transitions, 2307 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-04 16:39:16,670 INFO L231 Difference]: Finished difference. Result has 161 places, 191 transitions, 1975 flow [2024-06-04 16:39:16,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1975, PETRI_PLACES=161, PETRI_TRANSITIONS=191} [2024-06-04 16:39:16,670 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 117 predicate places. [2024-06-04 16:39:16,670 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 191 transitions, 1975 flow [2024-06-04 16:39:16,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:16,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:16,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:16,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 16:39:16,672 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:39:16,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -475562333, now seen corresponding path program 3 times [2024-06-04 16:39:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196824984] [2024-06-04 16:39:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196824984] [2024-06-04 16:39:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196824984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:29,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:29,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:39:29,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360452481] [2024-06-04 16:39:29,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:29,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:39:29,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:29,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:39:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:39:29,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:39:29,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 191 transitions, 1975 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:29,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:29,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:39:29,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:30,717 INFO L124 PetriNetUnfolderBase]: 2417/3976 cut-off events. [2024-06-04 16:39:30,717 INFO L125 PetriNetUnfolderBase]: For 179877/179890 co-relation queries the response was YES. [2024-06-04 16:39:30,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26557 conditions, 3976 events. 2417/3976 cut-off events. For 179877/179890 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23660 event pairs, 626 based on Foata normal form. 11/3959 useless extension candidates. Maximal degree in co-relation 26480. Up to 3597 conditions per place. [2024-06-04 16:39:30,747 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 156 selfloop transitions, 30 changer transitions 0/207 dead transitions. [2024-06-04 16:39:30,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 207 transitions, 2453 flow [2024-06-04 16:39:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:39:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:39:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-04 16:39:30,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318936877076412 [2024-06-04 16:39:30,748 INFO L175 Difference]: Start difference. First operand has 161 places, 191 transitions, 1975 flow. Second operand 7 states and 130 transitions. [2024-06-04 16:39:30,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 207 transitions, 2453 flow [2024-06-04 16:39:30,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 207 transitions, 2361 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-04 16:39:30,878 INFO L231 Difference]: Finished difference. Result has 164 places, 197 transitions, 2049 flow [2024-06-04 16:39:30,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2049, PETRI_PLACES=164, PETRI_TRANSITIONS=197} [2024-06-04 16:39:30,879 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 120 predicate places. [2024-06-04 16:39:30,879 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 197 transitions, 2049 flow [2024-06-04 16:39:30,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:30,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:30,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:30,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 16:39:30,880 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:39:30,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -682626678, now seen corresponding path program 1 times [2024-06-04 16:39:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958221476] [2024-06-04 16:39:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:41,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958221476] [2024-06-04 16:39:41,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958221476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:41,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:41,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:39:41,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949830331] [2024-06-04 16:39:41,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:41,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:39:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:41,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:39:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:39:41,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:39:41,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 197 transitions, 2049 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:41,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:41,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:39:41,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:43,080 INFO L124 PetriNetUnfolderBase]: 2439/4019 cut-off events. [2024-06-04 16:39:43,081 INFO L125 PetriNetUnfolderBase]: For 191992/191992 co-relation queries the response was YES. [2024-06-04 16:39:43,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27327 conditions, 4019 events. 2439/4019 cut-off events. For 191992/191992 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 23845 event pairs, 642 based on Foata normal form. 2/4019 useless extension candidates. Maximal degree in co-relation 27248. Up to 3680 conditions per place. [2024-06-04 16:39:43,116 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 193 selfloop transitions, 14 changer transitions 0/217 dead transitions. [2024-06-04 16:39:43,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 217 transitions, 2555 flow [2024-06-04 16:39:43,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:39:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:39:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-04 16:39:43,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2024-06-04 16:39:43,117 INFO L175 Difference]: Start difference. First operand has 164 places, 197 transitions, 2049 flow. Second operand 7 states and 134 transitions. [2024-06-04 16:39:43,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 217 transitions, 2555 flow [2024-06-04 16:39:43,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 217 transitions, 2475 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-04 16:39:43,279 INFO L231 Difference]: Finished difference. Result has 168 places, 200 transitions, 2049 flow [2024-06-04 16:39:43,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1969, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2049, PETRI_PLACES=168, PETRI_TRANSITIONS=200} [2024-06-04 16:39:43,279 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 124 predicate places. [2024-06-04 16:39:43,279 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 200 transitions, 2049 flow [2024-06-04 16:39:43,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:43,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:43,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:43,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 16:39:43,280 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:39:43,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1012545023, now seen corresponding path program 1 times [2024-06-04 16:39:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:43,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351370383] [2024-06-04 16:39:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:43,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351370383] [2024-06-04 16:39:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351370383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:54,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:39:54,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073395243] [2024-06-04 16:39:54,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:54,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:39:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:54,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:39:54,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:39:54,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:39:54,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 200 transitions, 2049 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:54,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:54,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:39:54,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:56,220 INFO L124 PetriNetUnfolderBase]: 2449/4035 cut-off events. [2024-06-04 16:39:56,220 INFO L125 PetriNetUnfolderBase]: For 200868/200868 co-relation queries the response was YES. [2024-06-04 16:39:56,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27941 conditions, 4035 events. 2449/4035 cut-off events. For 200868/200868 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 23933 event pairs, 641 based on Foata normal form. 3/4036 useless extension candidates. Maximal degree in co-relation 27860. Up to 3700 conditions per place. [2024-06-04 16:39:56,252 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 193 selfloop transitions, 14 changer transitions 0/217 dead transitions. [2024-06-04 16:39:56,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 217 transitions, 2543 flow [2024-06-04 16:39:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:39:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:39:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 16:39:56,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2024-06-04 16:39:56,257 INFO L175 Difference]: Start difference. First operand has 168 places, 200 transitions, 2049 flow. Second operand 7 states and 131 transitions. [2024-06-04 16:39:56,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 217 transitions, 2543 flow [2024-06-04 16:39:56,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 217 transitions, 2485 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 16:39:56,438 INFO L231 Difference]: Finished difference. Result has 170 places, 203 transitions, 2069 flow [2024-06-04 16:39:56,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2069, PETRI_PLACES=170, PETRI_TRANSITIONS=203} [2024-06-04 16:39:56,439 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 126 predicate places. [2024-06-04 16:39:56,439 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 203 transitions, 2069 flow [2024-06-04 16:39:56,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:56,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:56,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:56,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 16:39:56,440 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:39:56,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash -682476948, now seen corresponding path program 2 times [2024-06-04 16:39:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:56,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563862492] [2024-06-04 16:39:56,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:56,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:07,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:07,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563862492] [2024-06-04 16:40:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563862492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495958987] [2024-06-04 16:40:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:07,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:07,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:07,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:07,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:40:07,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 203 transitions, 2069 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:07,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:07,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:40:07,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:08,726 INFO L124 PetriNetUnfolderBase]: 2459/4051 cut-off events. [2024-06-04 16:40:08,727 INFO L125 PetriNetUnfolderBase]: For 207798/207798 co-relation queries the response was YES. [2024-06-04 16:40:08,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28428 conditions, 4051 events. 2459/4051 cut-off events. For 207798/207798 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24023 event pairs, 641 based on Foata normal form. 2/4051 useless extension candidates. Maximal degree in co-relation 28346. Up to 3699 conditions per place. [2024-06-04 16:40:08,757 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 192 selfloop transitions, 19 changer transitions 0/221 dead transitions. [2024-06-04 16:40:08,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 221 transitions, 2585 flow [2024-06-04 16:40:08,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:40:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:40:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-04 16:40:08,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2024-06-04 16:40:08,758 INFO L175 Difference]: Start difference. First operand has 170 places, 203 transitions, 2069 flow. Second operand 7 states and 134 transitions. [2024-06-04 16:40:08,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 221 transitions, 2585 flow [2024-06-04 16:40:08,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 221 transitions, 2531 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 16:40:08,927 INFO L231 Difference]: Finished difference. Result has 172 places, 206 transitions, 2113 flow [2024-06-04 16:40:08,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2015, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2113, PETRI_PLACES=172, PETRI_TRANSITIONS=206} [2024-06-04 16:40:08,927 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 128 predicate places. [2024-06-04 16:40:08,928 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 206 transitions, 2113 flow [2024-06-04 16:40:08,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:08,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:08,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:08,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 16:40:08,928 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:40:08,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1006981050, now seen corresponding path program 3 times [2024-06-04 16:40:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617512944] [2024-06-04 16:40:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:19,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617512944] [2024-06-04 16:40:19,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617512944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:19,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:19,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:40:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030354591] [2024-06-04 16:40:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:19,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:40:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:40:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:40:20,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:40:20,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 206 transitions, 2113 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:20,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:20,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:40:20,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:21,527 INFO L124 PetriNetUnfolderBase]: 2461/4056 cut-off events. [2024-06-04 16:40:21,527 INFO L125 PetriNetUnfolderBase]: For 215642/215642 co-relation queries the response was YES. [2024-06-04 16:40:21,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28903 conditions, 4056 events. 2461/4056 cut-off events. For 215642/215642 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24083 event pairs, 641 based on Foata normal form. 2/4056 useless extension candidates. Maximal degree in co-relation 28820. Up to 3690 conditions per place. [2024-06-04 16:40:21,559 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 188 selfloop transitions, 27 changer transitions 0/225 dead transitions. [2024-06-04 16:40:21,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 225 transitions, 2645 flow [2024-06-04 16:40:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:40:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:40:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-04 16:40:21,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2024-06-04 16:40:21,560 INFO L175 Difference]: Start difference. First operand has 172 places, 206 transitions, 2113 flow. Second operand 8 states and 150 transitions. [2024-06-04 16:40:21,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 225 transitions, 2645 flow [2024-06-04 16:40:21,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 225 transitions, 2569 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 16:40:21,740 INFO L231 Difference]: Finished difference. Result has 175 places, 209 transitions, 2157 flow [2024-06-04 16:40:21,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2157, PETRI_PLACES=175, PETRI_TRANSITIONS=209} [2024-06-04 16:40:21,741 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 131 predicate places. [2024-06-04 16:40:21,741 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 209 transitions, 2157 flow [2024-06-04 16:40:21,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:21,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:21,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:21,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 16:40:21,742 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:40:21,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:21,742 INFO L85 PathProgramCache]: Analyzing trace with hash -475823291, now seen corresponding path program 2 times [2024-06-04 16:40:21,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:21,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680347826] [2024-06-04 16:40:21,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:21,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680347826] [2024-06-04 16:40:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680347826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:40:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693990117] [2024-06-04 16:40:33,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:33,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:40:33,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:40:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:40:33,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:40:33,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 209 transitions, 2157 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:33,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:33,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:40:33,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:35,257 INFO L124 PetriNetUnfolderBase]: 2471/4071 cut-off events. [2024-06-04 16:40:35,258 INFO L125 PetriNetUnfolderBase]: For 224839/224842 co-relation queries the response was YES. [2024-06-04 16:40:35,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29481 conditions, 4071 events. 2471/4071 cut-off events. For 224839/224842 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24162 event pairs, 643 based on Foata normal form. 4/4072 useless extension candidates. Maximal degree in co-relation 29397. Up to 3726 conditions per place. [2024-06-04 16:40:35,293 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 193 selfloop transitions, 19 changer transitions 0/222 dead transitions. [2024-06-04 16:40:35,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 222 transitions, 2657 flow [2024-06-04 16:40:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:40:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:40:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-04 16:40:35,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 16:40:35,294 INFO L175 Difference]: Start difference. First operand has 175 places, 209 transitions, 2157 flow. Second operand 7 states and 129 transitions. [2024-06-04 16:40:35,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 222 transitions, 2657 flow [2024-06-04 16:40:35,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 222 transitions, 2559 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 16:40:35,504 INFO L231 Difference]: Finished difference. Result has 176 places, 212 transitions, 2157 flow [2024-06-04 16:40:35,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2059, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2157, PETRI_PLACES=176, PETRI_TRANSITIONS=212} [2024-06-04 16:40:35,505 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 132 predicate places. [2024-06-04 16:40:35,505 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 212 transitions, 2157 flow [2024-06-04 16:40:35,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:35,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:35,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:35,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 16:40:35,505 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:40:35,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash -475556381, now seen corresponding path program 3 times [2024-06-04 16:40:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:35,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815591469] [2024-06-04 16:40:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:47,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815591469] [2024-06-04 16:40:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815591469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:40:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321696452] [2024-06-04 16:40:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:47,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:40:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:47,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:40:47,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:40:47,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:40:47,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 212 transitions, 2157 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:47,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:47,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:40:47,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:48,809 INFO L124 PetriNetUnfolderBase]: 2465/4063 cut-off events. [2024-06-04 16:40:48,809 INFO L125 PetriNetUnfolderBase]: For 229814/229817 co-relation queries the response was YES. [2024-06-04 16:40:48,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29643 conditions, 4063 events. 2465/4063 cut-off events. For 229814/229817 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24126 event pairs, 644 based on Foata normal form. 4/4064 useless extension candidates. Maximal degree in co-relation 29558. Up to 3707 conditions per place. [2024-06-04 16:40:48,842 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 189 selfloop transitions, 29 changer transitions 0/228 dead transitions. [2024-06-04 16:40:48,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 228 transitions, 2691 flow [2024-06-04 16:40:48,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:40:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:40:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-04 16:40:48,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318936877076412 [2024-06-04 16:40:48,845 INFO L175 Difference]: Start difference. First operand has 176 places, 212 transitions, 2157 flow. Second operand 7 states and 130 transitions. [2024-06-04 16:40:48,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 228 transitions, 2691 flow [2024-06-04 16:40:49,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 228 transitions, 2615 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 16:40:49,056 INFO L231 Difference]: Finished difference. Result has 179 places, 218 transitions, 2240 flow [2024-06-04 16:40:49,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2081, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2240, PETRI_PLACES=179, PETRI_TRANSITIONS=218} [2024-06-04 16:40:49,057 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places. [2024-06-04 16:40:49,057 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 218 transitions, 2240 flow [2024-06-04 16:40:49,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:49,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:49,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:49,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 16:40:49,057 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:40:49,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash -475546461, now seen corresponding path program 1 times [2024-06-04 16:40:49,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:49,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873239789] [2024-06-04 16:40:49,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:49,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:01,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:01,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873239789] [2024-06-04 16:41:01,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873239789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:01,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:01,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:41:01,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038276741] [2024-06-04 16:41:01,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:01,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:41:01,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:01,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:41:01,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:41:01,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:41:01,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 218 transitions, 2240 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:01,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:01,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:41:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:02,729 INFO L124 PetriNetUnfolderBase]: 2472/4038 cut-off events. [2024-06-04 16:41:02,729 INFO L125 PetriNetUnfolderBase]: For 239645/239657 co-relation queries the response was YES. [2024-06-04 16:41:02,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29898 conditions, 4038 events. 2472/4038 cut-off events. For 239645/239657 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23995 event pairs, 644 based on Foata normal form. 13/4016 useless extension candidates. Maximal degree in co-relation 29811. Up to 3672 conditions per place. [2024-06-04 16:41:02,765 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 190 selfloop transitions, 17 changer transitions 0/232 dead transitions. [2024-06-04 16:41:02,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 232 transitions, 2748 flow [2024-06-04 16:41:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:41:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:41:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 16:41:02,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127906976744186 [2024-06-04 16:41:02,768 INFO L175 Difference]: Start difference. First operand has 179 places, 218 transitions, 2240 flow. Second operand 8 states and 142 transitions. [2024-06-04 16:41:02,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 232 transitions, 2748 flow [2024-06-04 16:41:02,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 232 transitions, 2682 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-04 16:41:02,951 INFO L231 Difference]: Finished difference. Result has 184 places, 221 transitions, 2284 flow [2024-06-04 16:41:02,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2284, PETRI_PLACES=184, PETRI_TRANSITIONS=221} [2024-06-04 16:41:02,952 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 140 predicate places. [2024-06-04 16:41:02,952 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 221 transitions, 2284 flow [2024-06-04 16:41:02,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:02,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:02,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:02,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 16:41:02,952 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:41:02,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2023773015, now seen corresponding path program 1 times [2024-06-04 16:41:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:02,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627863190] [2024-06-04 16:41:02,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627863190] [2024-06-04 16:41:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627863190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:14,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:41:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932119875] [2024-06-04 16:41:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:14,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:41:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:41:14,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:41:14,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:41:14,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 221 transitions, 2284 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:14,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:14,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:41:14,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:16,192 INFO L124 PetriNetUnfolderBase]: 2581/4187 cut-off events. [2024-06-04 16:41:16,192 INFO L125 PetriNetUnfolderBase]: For 248469/248476 co-relation queries the response was YES. [2024-06-04 16:41:16,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31118 conditions, 4187 events. 2581/4187 cut-off events. For 248469/248476 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24554 event pairs, 640 based on Foata normal form. 8/4192 useless extension candidates. Maximal degree in co-relation 31029. Up to 3815 conditions per place. [2024-06-04 16:41:16,228 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 205 selfloop transitions, 37 changer transitions 0/247 dead transitions. [2024-06-04 16:41:16,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 247 transitions, 2906 flow [2024-06-04 16:41:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:41:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:41:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-04 16:41:16,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2024-06-04 16:41:16,229 INFO L175 Difference]: Start difference. First operand has 184 places, 221 transitions, 2284 flow. Second operand 8 states and 153 transitions. [2024-06-04 16:41:16,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 247 transitions, 2906 flow [2024-06-04 16:41:16,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 247 transitions, 2788 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-04 16:41:16,430 INFO L231 Difference]: Finished difference. Result has 185 places, 225 transitions, 2327 flow [2024-06-04 16:41:16,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2327, PETRI_PLACES=185, PETRI_TRANSITIONS=225} [2024-06-04 16:41:16,430 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2024-06-04 16:41:16,430 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 225 transitions, 2327 flow [2024-06-04 16:41:16,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:16,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:16,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:16,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 16:41:16,431 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:41:16,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash -890445527, now seen corresponding path program 1 times [2024-06-04 16:41:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969462610] [2024-06-04 16:41:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969462610] [2024-06-04 16:41:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969462610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:41:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088461736] [2024-06-04 16:41:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:27,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:41:27,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:27,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:41:27,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:41:27,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:41:27,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 225 transitions, 2327 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:27,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:27,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:41:27,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:28,903 INFO L124 PetriNetUnfolderBase]: 2591/4190 cut-off events. [2024-06-04 16:41:28,904 INFO L125 PetriNetUnfolderBase]: For 257690/257694 co-relation queries the response was YES. [2024-06-04 16:41:28,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31870 conditions, 4190 events. 2591/4190 cut-off events. For 257690/257694 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24445 event pairs, 628 based on Foata normal form. 6/4194 useless extension candidates. Maximal degree in co-relation 31781. Up to 3835 conditions per place. [2024-06-04 16:41:28,940 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 218 selfloop transitions, 35 changer transitions 0/258 dead transitions. [2024-06-04 16:41:28,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 258 transitions, 2976 flow [2024-06-04 16:41:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:41:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:41:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-04 16:41:28,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-04 16:41:28,943 INFO L175 Difference]: Start difference. First operand has 185 places, 225 transitions, 2327 flow. Second operand 9 states and 171 transitions. [2024-06-04 16:41:28,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 258 transitions, 2976 flow [2024-06-04 16:41:29,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 258 transitions, 2843 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-04 16:41:29,128 INFO L231 Difference]: Finished difference. Result has 188 places, 229 transitions, 2335 flow [2024-06-04 16:41:29,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2335, PETRI_PLACES=188, PETRI_TRANSITIONS=229} [2024-06-04 16:41:29,128 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 144 predicate places. [2024-06-04 16:41:29,128 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 229 transitions, 2335 flow [2024-06-04 16:41:29,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:29,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:29,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:29,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 16:41:29,129 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:41:29,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash -883779287, now seen corresponding path program 2 times [2024-06-04 16:41:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:29,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410294220] [2024-06-04 16:41:29,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:29,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:40,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:40,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410294220] [2024-06-04 16:41:40,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410294220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:40,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:40,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:41:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029146385] [2024-06-04 16:41:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:40,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:41:40,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:40,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:41:40,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:41:40,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:41:40,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 229 transitions, 2335 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:40,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:40,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:41:40,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:41,864 INFO L124 PetriNetUnfolderBase]: 2593/4193 cut-off events. [2024-06-04 16:41:41,864 INFO L125 PetriNetUnfolderBase]: For 265302/265306 co-relation queries the response was YES. [2024-06-04 16:41:41,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31993 conditions, 4193 events. 2593/4193 cut-off events. For 265302/265306 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 24497 event pairs, 628 based on Foata normal form. 6/4197 useless extension candidates. Maximal degree in co-relation 31903. Up to 3800 conditions per place. [2024-06-04 16:41:41,904 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 208 selfloop transitions, 46 changer transitions 0/259 dead transitions. [2024-06-04 16:41:41,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 259 transitions, 3079 flow [2024-06-04 16:41:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:41:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:41:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-04 16:41:41,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392764857881137 [2024-06-04 16:41:41,907 INFO L175 Difference]: Start difference. First operand has 188 places, 229 transitions, 2335 flow. Second operand 9 states and 170 transitions. [2024-06-04 16:41:41,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 259 transitions, 3079 flow [2024-06-04 16:41:42,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 259 transitions, 2981 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 16:41:42,152 INFO L231 Difference]: Finished difference. Result has 190 places, 232 transitions, 2394 flow [2024-06-04 16:41:42,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2394, PETRI_PLACES=190, PETRI_TRANSITIONS=232} [2024-06-04 16:41:42,153 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places. [2024-06-04 16:41:42,153 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 232 transitions, 2394 flow [2024-06-04 16:41:42,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:42,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:42,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:42,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 16:41:42,153 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:41:42,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1481990442, now seen corresponding path program 1 times [2024-06-04 16:41:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:42,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539625477] [2024-06-04 16:41:42,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:42,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:51,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539625477] [2024-06-04 16:41:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539625477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:41:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103631638] [2024-06-04 16:41:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:51,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:41:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:41:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:41:51,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:41:51,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 232 transitions, 2394 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:51,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:51,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:41:51,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:53,828 INFO L124 PetriNetUnfolderBase]: 2675/4332 cut-off events. [2024-06-04 16:41:53,828 INFO L125 PetriNetUnfolderBase]: For 285275/285278 co-relation queries the response was YES. [2024-06-04 16:41:53,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32841 conditions, 4332 events. 2675/4332 cut-off events. For 285275/285278 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25499 event pairs, 634 based on Foata normal form. 12/4339 useless extension candidates. Maximal degree in co-relation 32750. Up to 3426 conditions per place. [2024-06-04 16:41:53,868 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 204 selfloop transitions, 80 changer transitions 0/289 dead transitions. [2024-06-04 16:41:53,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 289 transitions, 3231 flow [2024-06-04 16:41:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:41:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:41:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-04 16:41:53,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45155038759689925 [2024-06-04 16:41:53,871 INFO L175 Difference]: Start difference. First operand has 190 places, 232 transitions, 2394 flow. Second operand 12 states and 233 transitions. [2024-06-04 16:41:53,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 289 transitions, 3231 flow [2024-06-04 16:41:54,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 289 transitions, 3127 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 16:41:54,100 INFO L231 Difference]: Finished difference. Result has 198 places, 239 transitions, 2573 flow [2024-06-04 16:41:54,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2573, PETRI_PLACES=198, PETRI_TRANSITIONS=239} [2024-06-04 16:41:54,101 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 154 predicate places. [2024-06-04 16:41:54,101 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 239 transitions, 2573 flow [2024-06-04 16:41:54,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:54,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:54,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:54,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 16:41:54,101 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:41:54,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -883770359, now seen corresponding path program 1 times [2024-06-04 16:41:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263111541] [2024-06-04 16:41:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:05,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263111541] [2024-06-04 16:42:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263111541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:42:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256555223] [2024-06-04 16:42:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:05,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:42:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:05,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:42:05,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:42:05,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:42:05,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 239 transitions, 2573 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:05,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:05,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:42:05,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:07,344 INFO L124 PetriNetUnfolderBase]: 2592/4256 cut-off events. [2024-06-04 16:42:07,344 INFO L125 PetriNetUnfolderBase]: For 287740/287744 co-relation queries the response was YES. [2024-06-04 16:42:07,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33122 conditions, 4256 events. 2592/4256 cut-off events. For 287740/287744 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25555 event pairs, 632 based on Foata normal form. 6/4236 useless extension candidates. Maximal degree in co-relation 33028. Up to 3830 conditions per place. [2024-06-04 16:42:07,383 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 211 selfloop transitions, 20 changer transitions 0/259 dead transitions. [2024-06-04 16:42:07,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 259 transitions, 3161 flow [2024-06-04 16:42:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:42:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:42:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-04 16:42:07,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331395348837209 [2024-06-04 16:42:07,384 INFO L175 Difference]: Start difference. First operand has 198 places, 239 transitions, 2573 flow. Second operand 8 states and 149 transitions. [2024-06-04 16:42:07,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 259 transitions, 3161 flow [2024-06-04 16:42:07,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 259 transitions, 2949 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-04 16:42:07,671 INFO L231 Difference]: Finished difference. Result has 195 places, 242 transitions, 2485 flow [2024-06-04 16:42:07,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2361, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2485, PETRI_PLACES=195, PETRI_TRANSITIONS=242} [2024-06-04 16:42:07,672 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places. [2024-06-04 16:42:07,672 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 242 transitions, 2485 flow [2024-06-04 16:42:07,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:07,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:07,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-06-04 16:42:07,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 16:42:07,673 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:42:07,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash -605364623, now seen corresponding path program 2 times [2024-06-04 16:42:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46714802] [2024-06-04 16:42:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:19,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46714802] [2024-06-04 16:42:19,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46714802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:19,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:19,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:42:19,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576747602] [2024-06-04 16:42:19,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:19,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:42:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:19,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:42:19,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:42:20,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:42:20,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 242 transitions, 2485 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:20,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:20,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:42:20,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:21,712 INFO L124 PetriNetUnfolderBase]: 2721/4424 cut-off events. [2024-06-04 16:42:21,712 INFO L125 PetriNetUnfolderBase]: For 300906/300909 co-relation queries the response was YES. [2024-06-04 16:42:21,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34208 conditions, 4424 events. 2721/4424 cut-off events. For 300906/300909 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 26320 event pairs, 657 based on Foata normal form. 4/4425 useless extension candidates. Maximal degree in co-relation 34116. Up to 3959 conditions per place. [2024-06-04 16:42:21,749 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 215 selfloop transitions, 50 changer transitions 0/270 dead transitions. [2024-06-04 16:42:21,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 270 transitions, 3483 flow [2024-06-04 16:42:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:42:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:42:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 16:42:21,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-04 16:42:21,750 INFO L175 Difference]: Start difference. First operand has 195 places, 242 transitions, 2485 flow. Second operand 8 states and 151 transitions. [2024-06-04 16:42:21,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 270 transitions, 3483 flow [2024-06-04 16:42:22,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 270 transitions, 3383 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-04 16:42:22,011 INFO L231 Difference]: Finished difference. Result has 198 places, 250 transitions, 2681 flow [2024-06-04 16:42:22,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2385, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2681, PETRI_PLACES=198, PETRI_TRANSITIONS=250} [2024-06-04 16:42:22,012 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 154 predicate places. [2024-06-04 16:42:22,012 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 250 transitions, 2681 flow [2024-06-04 16:42:22,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:22,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:22,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:22,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 16:42:22,012 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:42:22,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash -883782883, now seen corresponding path program 3 times [2024-06-04 16:42:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:22,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875142039] [2024-06-04 16:42:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875142039] [2024-06-04 16:42:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875142039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:34,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:34,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:42:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148981876] [2024-06-04 16:42:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:34,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:42:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:42:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:42:34,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:42:34,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 250 transitions, 2681 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:35,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:35,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:42:35,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:36,571 INFO L124 PetriNetUnfolderBase]: 2725/4430 cut-off events. [2024-06-04 16:42:36,572 INFO L125 PetriNetUnfolderBase]: For 313202/313205 co-relation queries the response was YES. [2024-06-04 16:42:36,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35005 conditions, 4430 events. 2725/4430 cut-off events. For 313202/313205 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 26354 event pairs, 665 based on Foata normal form. 4/4431 useless extension candidates. Maximal degree in co-relation 34911. Up to 4005 conditions per place. [2024-06-04 16:42:36,613 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 221 selfloop transitions, 46 changer transitions 0/272 dead transitions. [2024-06-04 16:42:36,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 272 transitions, 3470 flow [2024-06-04 16:42:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:42:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:42:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-04 16:42:36,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331395348837209 [2024-06-04 16:42:36,615 INFO L175 Difference]: Start difference. First operand has 198 places, 250 transitions, 2681 flow. Second operand 8 states and 149 transitions. [2024-06-04 16:42:36,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 272 transitions, 3470 flow [2024-06-04 16:42:36,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 272 transitions, 3319 flow, removed 52 selfloop flow, removed 4 redundant places. [2024-06-04 16:42:36,961 INFO L231 Difference]: Finished difference. Result has 202 places, 254 transitions, 2730 flow [2024-06-04 16:42:36,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2542, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2730, PETRI_PLACES=202, PETRI_TRANSITIONS=254} [2024-06-04 16:42:36,962 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 158 predicate places. [2024-06-04 16:42:36,962 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 254 transitions, 2730 flow [2024-06-04 16:42:36,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:36,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:36,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:36,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 16:42:36,962 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:42:36,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1891729111, now seen corresponding path program 3 times [2024-06-04 16:42:36,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363418236] [2024-06-04 16:42:36,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:49,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363418236] [2024-06-04 16:42:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363418236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:49,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:49,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:42:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073139029] [2024-06-04 16:42:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:49,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:42:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:42:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:42:49,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:42:49,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 254 transitions, 2730 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:49,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:49,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:42:49,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:50,914 INFO L124 PetriNetUnfolderBase]: 2741/4457 cut-off events. [2024-06-04 16:42:50,914 INFO L125 PetriNetUnfolderBase]: For 320040/320049 co-relation queries the response was YES. [2024-06-04 16:42:50,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35430 conditions, 4457 events. 2741/4457 cut-off events. For 320040/320049 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26390 event pairs, 621 based on Foata normal form. 7/4460 useless extension candidates. Maximal degree in co-relation 35334. Up to 4085 conditions per place. [2024-06-04 16:42:50,958 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 241 selfloop transitions, 37 changer transitions 0/283 dead transitions. [2024-06-04 16:42:50,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 283 transitions, 3465 flow [2024-06-04 16:42:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:42:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:42:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-04 16:42:50,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4160206718346253 [2024-06-04 16:42:50,959 INFO L175 Difference]: Start difference. First operand has 202 places, 254 transitions, 2730 flow. Second operand 9 states and 161 transitions. [2024-06-04 16:42:50,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 283 transitions, 3465 flow [2024-06-04 16:42:51,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 283 transitions, 3278 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-04 16:42:51,270 INFO L231 Difference]: Finished difference. Result has 208 places, 262 transitions, 2779 flow [2024-06-04 16:42:51,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2779, PETRI_PLACES=208, PETRI_TRANSITIONS=262} [2024-06-04 16:42:51,271 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 164 predicate places. [2024-06-04 16:42:51,271 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 262 transitions, 2779 flow [2024-06-04 16:42:51,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:51,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:51,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:51,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 16:42:51,271 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:42:51,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1324138003, now seen corresponding path program 4 times [2024-06-04 16:42:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:51,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630626885] [2024-06-04 16:42:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:02,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630626885] [2024-06-04 16:43:02,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630626885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:02,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:02,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:43:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268338841] [2024-06-04 16:43:02,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:02,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:43:02,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:02,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:43:02,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:43:02,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:43:02,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 262 transitions, 2779 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:02,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:02,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:43:02,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:03,670 INFO L124 PetriNetUnfolderBase]: 2746/4465 cut-off events. [2024-06-04 16:43:03,670 INFO L125 PetriNetUnfolderBase]: For 329734/329749 co-relation queries the response was YES. [2024-06-04 16:43:03,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35702 conditions, 4465 events. 2746/4465 cut-off events. For 329734/329749 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26444 event pairs, 617 based on Foata normal form. 11/4472 useless extension candidates. Maximal degree in co-relation 35602. Up to 4056 conditions per place. [2024-06-04 16:43:03,715 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 229 selfloop transitions, 50 changer transitions 0/284 dead transitions. [2024-06-04 16:43:03,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 284 transitions, 3451 flow [2024-06-04 16:43:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:43:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:43:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-04 16:43:03,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2024-06-04 16:43:03,716 INFO L175 Difference]: Start difference. First operand has 208 places, 262 transitions, 2779 flow. Second operand 8 states and 150 transitions. [2024-06-04 16:43:03,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 284 transitions, 3451 flow [2024-06-04 16:43:04,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 284 transitions, 3350 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-04 16:43:04,035 INFO L231 Difference]: Finished difference. Result has 211 places, 265 transitions, 2846 flow [2024-06-04 16:43:04,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2678, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2846, PETRI_PLACES=211, PETRI_TRANSITIONS=265} [2024-06-04 16:43:04,036 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 167 predicate places. [2024-06-04 16:43:04,036 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 265 transitions, 2846 flow [2024-06-04 16:43:04,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:04,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:04,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:04,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 16:43:04,037 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:43:04,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash -21733584, now seen corresponding path program 2 times [2024-06-04 16:43:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:04,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805493072] [2024-06-04 16:43:04,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:13,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:13,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805493072] [2024-06-04 16:43:13,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805493072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:13,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181318200] [2024-06-04 16:43:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:13,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:13,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:43:13,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 265 transitions, 2846 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:13,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:13,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:43:13,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:15,666 INFO L124 PetriNetUnfolderBase]: 2856/4646 cut-off events. [2024-06-04 16:43:15,666 INFO L125 PetriNetUnfolderBase]: For 353691/353691 co-relation queries the response was YES. [2024-06-04 16:43:15,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36853 conditions, 4646 events. 2856/4646 cut-off events. For 353691/353691 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 27794 event pairs, 643 based on Foata normal form. 12/4648 useless extension candidates. Maximal degree in co-relation 36751. Up to 3806 conditions per place. [2024-06-04 16:43:15,710 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 222 selfloop transitions, 96 changer transitions 0/323 dead transitions. [2024-06-04 16:43:15,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 323 transitions, 3753 flow [2024-06-04 16:43:15,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 16:43:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 16:43:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 250 transitions. [2024-06-04 16:43:15,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472271914132379 [2024-06-04 16:43:15,713 INFO L175 Difference]: Start difference. First operand has 211 places, 265 transitions, 2846 flow. Second operand 13 states and 250 transitions. [2024-06-04 16:43:15,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 323 transitions, 3753 flow [2024-06-04 16:43:16,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 323 transitions, 3617 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 16:43:16,065 INFO L231 Difference]: Finished difference. Result has 220 places, 271 transitions, 3005 flow [2024-06-04 16:43:16,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2710, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3005, PETRI_PLACES=220, PETRI_TRANSITIONS=271} [2024-06-04 16:43:16,066 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 176 predicate places. [2024-06-04 16:43:16,066 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 271 transitions, 3005 flow [2024-06-04 16:43:16,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:16,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:16,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:16,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 16:43:16,066 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:43:16,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 108342998, now seen corresponding path program 3 times [2024-06-04 16:43:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153296795] [2024-06-04 16:43:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:25,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:25,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153296795] [2024-06-04 16:43:25,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153296795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:25,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:25,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:25,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321839508] [2024-06-04 16:43:25,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:25,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:25,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:25,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:25,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:25,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:43:25,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 271 transitions, 3005 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:25,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:25,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:43:25,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:28,126 INFO L124 PetriNetUnfolderBase]: 2938/4798 cut-off events. [2024-06-04 16:43:28,126 INFO L125 PetriNetUnfolderBase]: For 368594/368594 co-relation queries the response was YES. [2024-06-04 16:43:28,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38302 conditions, 4798 events. 2938/4798 cut-off events. For 368594/368594 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 28993 event pairs, 668 based on Foata normal form. 12/4800 useless extension candidates. Maximal degree in co-relation 38197. Up to 3948 conditions per place. [2024-06-04 16:43:28,171 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 220 selfloop transitions, 104 changer transitions 0/329 dead transitions. [2024-06-04 16:43:28,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 329 transitions, 3944 flow [2024-06-04 16:43:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 16:43:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 16:43:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 248 transitions. [2024-06-04 16:43:28,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44364937388193204 [2024-06-04 16:43:28,174 INFO L175 Difference]: Start difference. First operand has 220 places, 271 transitions, 3005 flow. Second operand 13 states and 248 transitions. [2024-06-04 16:43:28,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 329 transitions, 3944 flow [2024-06-04 16:43:28,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 329 transitions, 3724 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-04 16:43:28,484 INFO L231 Difference]: Finished difference. Result has 226 places, 278 transitions, 3129 flow [2024-06-04 16:43:28,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2793, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3129, PETRI_PLACES=226, PETRI_TRANSITIONS=278} [2024-06-04 16:43:28,484 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 182 predicate places. [2024-06-04 16:43:28,484 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 278 transitions, 3129 flow [2024-06-04 16:43:28,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:28,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:28,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:28,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 16:43:28,485 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:43:28,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash 403562198, now seen corresponding path program 4 times [2024-06-04 16:43:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:28,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748949898] [2024-06-04 16:43:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:28,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748949898] [2024-06-04 16:43:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748949898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710071379] [2024-06-04 16:43:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:38,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:38,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:38,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:38,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:43:38,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 278 transitions, 3129 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:38,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:38,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:43:38,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:40,878 INFO L124 PetriNetUnfolderBase]: 2959/4847 cut-off events. [2024-06-04 16:43:40,878 INFO L125 PetriNetUnfolderBase]: For 366334/366334 co-relation queries the response was YES. [2024-06-04 16:43:40,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38297 conditions, 4847 events. 2959/4847 cut-off events. For 366334/366334 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 29464 event pairs, 534 based on Foata normal form. 12/4849 useless extension candidates. Maximal degree in co-relation 38189. Up to 3197 conditions per place. [2024-06-04 16:43:40,928 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 207 selfloop transitions, 116 changer transitions 0/328 dead transitions. [2024-06-04 16:43:40,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 328 transitions, 4090 flow [2024-06-04 16:43:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:43:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:43:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-04 16:43:40,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45155038759689925 [2024-06-04 16:43:40,931 INFO L175 Difference]: Start difference. First operand has 226 places, 278 transitions, 3129 flow. Second operand 12 states and 233 transitions. [2024-06-04 16:43:40,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 328 transitions, 4090 flow [2024-06-04 16:43:41,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 328 transitions, 3892 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-04 16:43:41,369 INFO L231 Difference]: Finished difference. Result has 232 places, 279 transitions, 3218 flow [2024-06-04 16:43:41,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2933, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3218, PETRI_PLACES=232, PETRI_TRANSITIONS=279} [2024-06-04 16:43:41,370 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 188 predicate places. [2024-06-04 16:43:41,370 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 279 transitions, 3218 flow [2024-06-04 16:43:41,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:41,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:41,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:41,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 16:43:41,370 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:43:41,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash 8593362, now seen corresponding path program 5 times [2024-06-04 16:43:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671994015] [2024-06-04 16:43:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671994015] [2024-06-04 16:43:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671994015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403258939] [2024-06-04 16:43:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:50,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:50,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:51,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:43:51,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 279 transitions, 3218 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:51,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:51,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:43:51,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:53,172 INFO L124 PetriNetUnfolderBase]: 2939/4796 cut-off events. [2024-06-04 16:43:53,172 INFO L125 PetriNetUnfolderBase]: For 362089/362089 co-relation queries the response was YES. [2024-06-04 16:43:53,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37738 conditions, 4796 events. 2939/4796 cut-off events. For 362089/362089 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 29057 event pairs, 681 based on Foata normal form. 12/4786 useless extension candidates. Maximal degree in co-relation 37628. Up to 3955 conditions per place. [2024-06-04 16:43:53,224 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 223 selfloop transitions, 97 changer transitions 0/325 dead transitions. [2024-06-04 16:43:53,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 325 transitions, 3964 flow [2024-06-04 16:43:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:43:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:43:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2024-06-04 16:43:53,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44573643410852715 [2024-06-04 16:43:53,226 INFO L175 Difference]: Start difference. First operand has 232 places, 279 transitions, 3218 flow. Second operand 12 states and 230 transitions. [2024-06-04 16:43:53,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 325 transitions, 3964 flow [2024-06-04 16:43:53,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 325 transitions, 3680 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-04 16:43:53,651 INFO L231 Difference]: Finished difference. Result has 233 places, 278 transitions, 3062 flow [2024-06-04 16:43:53,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2864, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3062, PETRI_PLACES=233, PETRI_TRANSITIONS=278} [2024-06-04 16:43:53,653 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 189 predicate places. [2024-06-04 16:43:53,653 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 278 transitions, 3062 flow [2024-06-04 16:43:53,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:53,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:53,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:53,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 16:43:53,654 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:43:53,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:53,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1865840885, now seen corresponding path program 5 times [2024-06-04 16:43:53,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:53,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515168021] [2024-06-04 16:43:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515168021] [2024-06-04 16:44:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515168021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:44:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264255389] [2024-06-04 16:44:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:04,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:44:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:44:04,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:44:04,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:44:04,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 278 transitions, 3062 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:04,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:04,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:44:04,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:06,465 INFO L124 PetriNetUnfolderBase]: 2941/4827 cut-off events. [2024-06-04 16:44:06,465 INFO L125 PetriNetUnfolderBase]: For 358018/358033 co-relation queries the response was YES. [2024-06-04 16:44:06,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37289 conditions, 4827 events. 2941/4827 cut-off events. For 358018/358033 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29465 event pairs, 653 based on Foata normal form. 12/4835 useless extension candidates. Maximal degree in co-relation 37179. Up to 4328 conditions per place. [2024-06-04 16:44:06,598 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 225 selfloop transitions, 68 changer transitions 0/298 dead transitions. [2024-06-04 16:44:06,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 298 transitions, 3884 flow [2024-06-04 16:44:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:44:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:44:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 16:44:06,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-04 16:44:06,600 INFO L175 Difference]: Start difference. First operand has 233 places, 278 transitions, 3062 flow. Second operand 8 states and 151 transitions. [2024-06-04 16:44:06,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 298 transitions, 3884 flow [2024-06-04 16:44:06,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 298 transitions, 3507 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-06-04 16:44:06,942 INFO L231 Difference]: Finished difference. Result has 228 places, 281 transitions, 2893 flow [2024-06-04 16:44:06,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2685, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2893, PETRI_PLACES=228, PETRI_TRANSITIONS=281} [2024-06-04 16:44:06,942 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 184 predicate places. [2024-06-04 16:44:06,942 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 281 transitions, 2893 flow [2024-06-04 16:44:06,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:06,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:06,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:06,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 16:44:06,943 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:44:06,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash -261137337, now seen corresponding path program 6 times [2024-06-04 16:44:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:06,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313563141] [2024-06-04 16:44:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313563141] [2024-06-04 16:44:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313563141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:18,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:44:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678094912] [2024-06-04 16:44:18,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:18,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:44:18,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:44:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:44:19,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:44:19,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 281 transitions, 2893 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:19,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:19,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:44:19,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:20,614 INFO L124 PetriNetUnfolderBase]: 2936/4821 cut-off events. [2024-06-04 16:44:20,614 INFO L125 PetriNetUnfolderBase]: For 361039/361054 co-relation queries the response was YES. [2024-06-04 16:44:20,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36376 conditions, 4821 events. 2936/4821 cut-off events. For 361039/361054 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 29423 event pairs, 653 based on Foata normal form. 11/4828 useless extension candidates. Maximal degree in co-relation 36267. Up to 4323 conditions per place. [2024-06-04 16:44:20,663 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 220 selfloop transitions, 72 changer transitions 0/297 dead transitions. [2024-06-04 16:44:20,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 297 transitions, 3525 flow [2024-06-04 16:44:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:44:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:44:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-04 16:44:20,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331395348837209 [2024-06-04 16:44:20,664 INFO L175 Difference]: Start difference. First operand has 228 places, 281 transitions, 2893 flow. Second operand 8 states and 149 transitions. [2024-06-04 16:44:20,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 297 transitions, 3525 flow [2024-06-04 16:44:21,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 297 transitions, 3325 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-04 16:44:21,038 INFO L231 Difference]: Finished difference. Result has 231 places, 281 transitions, 2843 flow [2024-06-04 16:44:21,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2693, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2843, PETRI_PLACES=231, PETRI_TRANSITIONS=281} [2024-06-04 16:44:21,039 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 187 predicate places. [2024-06-04 16:44:21,039 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 281 transitions, 2843 flow [2024-06-04 16:44:21,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:21,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:21,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:21,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 16:44:21,039 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:44:21,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1945074591, now seen corresponding path program 2 times [2024-06-04 16:44:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203617574] [2024-06-04 16:44:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203617574] [2024-06-04 16:44:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203617574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:34,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:44:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805860453] [2024-06-04 16:44:34,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:34,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:44:34,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:44:34,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:44:34,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:44:34,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 281 transitions, 2843 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:34,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:34,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:44:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:35,805 INFO L124 PetriNetUnfolderBase]: 2842/4707 cut-off events. [2024-06-04 16:44:35,805 INFO L125 PetriNetUnfolderBase]: For 370544/370559 co-relation queries the response was YES. [2024-06-04 16:44:35,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35841 conditions, 4707 events. 2842/4707 cut-off events. For 370544/370559 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 29062 event pairs, 637 based on Foata normal form. 11/4690 useless extension candidates. Maximal degree in co-relation 35731. Up to 4236 conditions per place. [2024-06-04 16:44:35,857 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 234 selfloop transitions, 26 changer transitions 0/294 dead transitions. [2024-06-04 16:44:35,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 294 transitions, 3473 flow [2024-06-04 16:44:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:44:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:44:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 16:44:35,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41569767441860467 [2024-06-04 16:44:35,858 INFO L175 Difference]: Start difference. First operand has 231 places, 281 transitions, 2843 flow. Second operand 8 states and 143 transitions. [2024-06-04 16:44:35,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 294 transitions, 3473 flow [2024-06-04 16:44:36,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 294 transitions, 3291 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 16:44:36,226 INFO L231 Difference]: Finished difference. Result has 231 places, 284 transitions, 2809 flow [2024-06-04 16:44:36,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2809, PETRI_PLACES=231, PETRI_TRANSITIONS=284} [2024-06-04 16:44:36,227 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 187 predicate places. [2024-06-04 16:44:36,227 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 284 transitions, 2809 flow [2024-06-04 16:44:36,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:36,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:36,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:36,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 16:44:36,227 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:44:36,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1871351011, now seen corresponding path program 4 times [2024-06-04 16:44:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:36,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424786784] [2024-06-04 16:44:36,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:36,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:48,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-06-04 16:44:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:48,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424786784] [2024-06-04 16:44:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424786784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:48,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:48,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:44:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312702206] [2024-06-04 16:44:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:48,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:44:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:44:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:44:48,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-04 16:44:48,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 284 transitions, 2809 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:48,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:48,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-04 16:44:48,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:50,413 INFO L124 PetriNetUnfolderBase]: 2951/4842 cut-off events. [2024-06-04 16:44:50,413 INFO L125 PetriNetUnfolderBase]: For 385030/385033 co-relation queries the response was YES. [2024-06-04 16:44:50,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36906 conditions, 4842 events. 2951/4842 cut-off events. For 385030/385033 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 29583 event pairs, 692 based on Foata normal form. 4/4835 useless extension candidates. Maximal degree in co-relation 36795. Up to 4338 conditions per place. [2024-06-04 16:44:50,468 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 226 selfloop transitions, 68 changer transitions 0/299 dead transitions. [2024-06-04 16:44:50,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 299 transitions, 3523 flow [2024-06-04 16:44:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:44:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:44:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 16:44:50,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2024-06-04 16:44:50,469 INFO L175 Difference]: Start difference. First operand has 231 places, 284 transitions, 2809 flow. Second operand 8 states and 144 transitions. [2024-06-04 16:44:50,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 299 transitions, 3523 flow [2024-06-04 16:44:51,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 299 transitions, 3397 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-04 16:44:51,012 INFO L231 Difference]: Finished difference. Result has 233 places, 288 transitions, 2928 flow [2024-06-04 16:44:51,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2683, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2928, PETRI_PLACES=233, PETRI_TRANSITIONS=288} [2024-06-04 16:44:51,013 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 189 predicate places. [2024-06-04 16:44:51,013 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 288 transitions, 2928 flow [2024-06-04 16:44:51,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:51,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:51,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:51,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 16:44:51,013 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:44:51,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:51,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1857528917, now seen corresponding path program 3 times [2024-06-04 16:44:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497168239] [2024-06-04 16:44:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:45:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:45:03,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:45:03,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497168239] [2024-06-04 16:45:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497168239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:45:03,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:45:03,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:45:03,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924709705] [2024-06-04 16:45:03,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:45:03,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:45:03,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:45:03,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:45:03,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:45:03,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-04 16:45:03,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 288 transitions, 2928 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:03,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:45:03,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-04 16:45:03,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:45:04,697 INFO L124 PetriNetUnfolderBase]: 2870/4748 cut-off events. [2024-06-04 16:45:04,697 INFO L125 PetriNetUnfolderBase]: For 399712/399727 co-relation queries the response was YES. [2024-06-04 16:45:04,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37305 conditions, 4748 events. 2870/4748 cut-off events. For 399712/399727 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 29358 event pairs, 638 based on Foata normal form. 12/4732 useless extension candidates. Maximal degree in co-relation 37193. Up to 4231 conditions per place. [2024-06-04 16:45:04,750 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 230 selfloop transitions, 47 changer transitions 0/312 dead transitions. [2024-06-04 16:45:04,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 312 transitions, 4076 flow [2024-06-04 16:45:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:45:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:45:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 16:45:04,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438953488372093 [2024-06-04 16:45:04,753 INFO L175 Difference]: Start difference. First operand has 233 places, 288 transitions, 2928 flow. Second operand 8 states and 151 transitions. [2024-06-04 16:45:04,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 312 transitions, 4076 flow [2024-06-04 16:45:05,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 312 transitions, 3859 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-04 16:45:05,217 INFO L231 Difference]: Finished difference. Result has 235 places, 297 transitions, 3087 flow [2024-06-04 16:45:05,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3087, PETRI_PLACES=235, PETRI_TRANSITIONS=297} [2024-06-04 16:45:05,218 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 191 predicate places. [2024-06-04 16:45:05,218 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 297 transitions, 3087 flow [2024-06-04 16:45:05,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:45:05,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:45:05,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:45:05,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 16:45:05,218 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 16:45:05,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:45:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1931265455, now seen corresponding path program 5 times [2024-06-04 16:45:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:45:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097692794] [2024-06-04 16:45:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:45:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:45:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15