./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.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/mix028_tso.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/mix028_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_tso.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 17:00:59,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:00:59,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:00:59,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:00:59,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:00:59,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:00:59,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:00:59,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:00:59,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:00:59,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:00:59,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:00:59,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:00:59,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:00:59,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:00:59,973 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:00:59,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:00:59,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:00:59,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:00:59,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:00:59,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:00:59,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:00:59,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:00:59,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:00:59,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:00:59,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:00:59,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:00:59,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:00:59,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:00:59,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:00:59,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:00:59,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:00:59,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:00:59,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:00:59,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:00:59,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:00:59,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:00:59,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:00:59,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:00:59,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:00:59,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:00:59,978 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:00:59,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:00:59,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:00:59,978 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 17:01:00,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:01:00,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:01:00,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:01:00,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:01:00,252 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:01:00,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2024-06-04 17:01:01,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:01:01,599 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:01:01,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2024-06-04 17:01:01,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c5cf4a9/9802ad0e37194dadbf21183a6d8152e2/FLAG1962b1b5a [2024-06-04 17:01:01,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c5cf4a9/9802ad0e37194dadbf21183a6d8152e2 [2024-06-04 17:01:01,633 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:01:01,634 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:01:01,635 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/mix028_tso.yml/witness.yml [2024-06-04 17:01:01,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:01:01,828 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:01:01,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:01:01,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:01:01,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:01:01,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:01:01" (1/2) ... [2024-06-04 17:01:01,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f39f489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:01:01, skipping insertion in model container [2024-06-04 17:01:01,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:01:01" (1/2) ... [2024-06-04 17:01:01,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7ee71c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:01:01, skipping insertion in model container [2024-06-04 17:01:01,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:01:01" (2/2) ... [2024-06-04 17:01:01,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f39f489 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:01:01, skipping insertion in model container [2024-06-04 17:01:01,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:01:01" (2/2) ... [2024-06-04 17:01:01,837 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:01:01,912 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:01:01,913 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] ((((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! 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_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_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_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_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 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p2_EBX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && 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) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-06-04 17:01:01,914 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! 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_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_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_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_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 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p2_EBX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && 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) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-06-04 17:01:01,915 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! 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_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_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_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_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 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p2_EBX <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && 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) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) [2024-06-04 17:01:01,915 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:01:01,915 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-04 17:01:01,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:01:02,260 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:01:02,268 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:01:02,540 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:01:02,568 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:01:02,568 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:01:02 WrapperNode [2024-06-04 17:01:02,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:01:02,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:01:02,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:01:02,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:01:02,575 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,598 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,821 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2024-06-04 17:01:02,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:01:02,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:01:02,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:01:02,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:01:02,831 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,832 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,859 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,901 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 17:01:02,902 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,902 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,946 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,952 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,978 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 05:01:02" (1/1) ... [2024-06-04 17:01:02,983 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 05:01:02" (1/1) ... [2024-06-04 17:01:03,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:01:03,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:01:03,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:01:03,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:01:03,008 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 05:01:02" (1/1) ... [2024-06-04 17:01:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:01:03,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:01:03,031 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 17:01:03,058 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 17:01:03,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:01:03,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:01:03,069 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:01:03,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:01:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:01:03,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:01:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 17:01:03,070 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 17:01:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:01:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:01:03,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:01:03,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:01:03,072 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 17:01:03,208 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:01:03,211 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:01:04,257 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:01:04,259 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:01:04,501 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:01:04,501 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:01:04,502 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:01:04 BoogieIcfgContainer [2024-06-04 17:01:04,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:01:04,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:01:04,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:01:04,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:01:04,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:01:01" (1/4) ... [2024-06-04 17:01:04,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b35c704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:01:04, skipping insertion in model container [2024-06-04 17:01:04,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:01:01" (2/4) ... [2024-06-04 17:01:04,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b35c704 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:01:04, skipping insertion in model container [2024-06-04 17:01:04,510 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 05:01:02" (3/4) ... [2024-06-04 17:01:04,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b35c704 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:01:04, skipping insertion in model container [2024-06-04 17:01:04,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:01:04" (4/4) ... [2024-06-04 17:01:04,511 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2024-06-04 17:01:04,525 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:01:04,525 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 17:01:04,525 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:01:04,627 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:01:04,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-04 17:01:04,716 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-04 17:01:04,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:01:04,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:01:04,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-04 17:01:04,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-04 17:01:04,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:01:04,738 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;@2f77422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:01:04,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 17:01:04,745 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:01:04,746 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:01:04,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:01:04,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:04,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:01:04,747 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 17:01:04,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash -492059225, now seen corresponding path program 1 times [2024-06-04 17:01:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:04,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102908126] [2024-06-04 17:01:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:09,679 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 17:01:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:09,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102908126] [2024-06-04 17:01:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102908126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:01:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616082121] [2024-06-04 17:01:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:09,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:01:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:09,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:01:09,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:01:09,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 17:01:09,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 17:01:09,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:09,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 17:01:09,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:10,545 INFO L124 PetriNetUnfolderBase]: 1359/2110 cut-off events. [2024-06-04 17:01:10,545 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-04 17:01:10,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4226 conditions, 2110 events. 1359/2110 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10225 event pairs, 941 based on Foata normal form. 1/2045 useless extension candidates. Maximal degree in co-relation 4211. Up to 2029 conditions per place. [2024-06-04 17:01:10,559 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2024-06-04 17:01:10,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 177 flow [2024-06-04 17:01:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:01:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:01:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-04 17:01:10,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2024-06-04 17:01:10,569 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 71 transitions. [2024-06-04 17:01:10,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 177 flow [2024-06-04 17:01:10,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 17:01:10,573 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-04 17:01:10,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-04 17:01:10,577 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-04 17:01:10,578 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-04 17:01:10,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 17:01:10,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:10,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:10,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:01:10,579 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 17:01:10,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -422483706, now seen corresponding path program 1 times [2024-06-04 17:01:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:10,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026234158] [2024-06-04 17:01:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:10,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:13,909 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 17:01:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026234158] [2024-06-04 17:01:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026234158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:13,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:01:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097119243] [2024-06-04 17:01:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:13,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:01:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:01:13,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:01:13,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:01:13,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 17:01:13,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:13,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:01:13,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:14,763 INFO L124 PetriNetUnfolderBase]: 1560/2338 cut-off events. [2024-06-04 17:01:14,763 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2024-06-04 17:01:14,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5356 conditions, 2338 events. 1560/2338 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11019 event pairs, 930 based on Foata normal form. 3/2339 useless extension candidates. Maximal degree in co-relation 5341. Up to 2302 conditions per place. [2024-06-04 17:01:14,777 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 42 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-04 17:01:14,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 246 flow [2024-06-04 17:01:14,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:01:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:01:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-06-04 17:01:14,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-04 17:01:14,781 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 88 transitions. [2024-06-04 17:01:14,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 246 flow [2024-06-04 17:01:14,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:01:14,785 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow [2024-06-04 17:01:14,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-04 17:01:14,786 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-04 17:01:14,786 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow [2024-06-04 17:01:14,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 17:01:14,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:14,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:14,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:01:14,789 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 17:01:14,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash -212092032, now seen corresponding path program 1 times [2024-06-04 17:01:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574788591] [2024-06-04 17:01:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:18,171 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 17:01:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:18,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574788591] [2024-06-04 17:01:18,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574788591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:18,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:18,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:01:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440426009] [2024-06-04 17:01:18,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:18,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:01:18,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:01:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:01:18,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:01:18,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 17:01:18,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:18,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:01:18,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:19,039 INFO L124 PetriNetUnfolderBase]: 1568/2358 cut-off events. [2024-06-04 17:01:19,039 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2024-06-04 17:01:19,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5993 conditions, 2358 events. 1568/2358 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11232 event pairs, 669 based on Foata normal form. 5/2360 useless extension candidates. Maximal degree in co-relation 5976. Up to 2248 conditions per place. [2024-06-04 17:01:19,055 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 55 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-06-04 17:01:19,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 400 flow [2024-06-04 17:01:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:01:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:01:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-04 17:01:19,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-04 17:01:19,057 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 115 transitions. [2024-06-04 17:01:19,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 400 flow [2024-06-04 17:01:19,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 386 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 17:01:19,060 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 237 flow [2024-06-04 17:01:19,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2024-06-04 17:01:19,061 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-04 17:01:19,061 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 237 flow [2024-06-04 17:01:19,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 17:01:19,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:19,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:19,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:01:19,062 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 17:01:19,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1956947905, now seen corresponding path program 1 times [2024-06-04 17:01:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803836275] [2024-06-04 17:01:19,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803836275] [2024-06-04 17:01:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803836275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:22,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:22,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:01:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78125131] [2024-06-04 17:01:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:22,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:01:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:01:22,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:01:22,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:01:22,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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 17:01:22,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:22,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:01:22,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:23,784 INFO L124 PetriNetUnfolderBase]: 1580/2378 cut-off events. [2024-06-04 17:01:23,784 INFO L125 PetriNetUnfolderBase]: For 3188/3191 co-relation queries the response was YES. [2024-06-04 17:01:23,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 2378 events. 1580/2378 cut-off events. For 3188/3191 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11316 event pairs, 481 based on Foata normal form. 12/2387 useless extension candidates. Maximal degree in co-relation 7117. Up to 2216 conditions per place. [2024-06-04 17:01:23,798 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 59 selfloop transitions, 19 changer transitions 0/82 dead transitions. [2024-06-04 17:01:23,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 503 flow [2024-06-04 17:01:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:01:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:01:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-04 17:01:23,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198412698412699 [2024-06-04 17:01:23,802 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 237 flow. Second operand 6 states and 131 transitions. [2024-06-04 17:01:23,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 503 flow [2024-06-04 17:01:23,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 495 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 17:01:23,809 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 293 flow [2024-06-04 17:01:23,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-06-04 17:01:23,810 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-04 17:01:23,810 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 293 flow [2024-06-04 17:01:23,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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 17:01:23,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:23,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:23,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:01:23,811 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 17:01:23,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1897621729, now seen corresponding path program 1 times [2024-06-04 17:01:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619594059] [2024-06-04 17:01:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:32,035 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 17:01:32,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:32,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619594059] [2024-06-04 17:01:32,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619594059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:32,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:32,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:01:32,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571472188] [2024-06-04 17:01:32,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:32,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:01:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:32,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:01:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:01:32,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:01:32,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 17:01:32,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:32,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:01:32,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:32,858 INFO L124 PetriNetUnfolderBase]: 1368/2119 cut-off events. [2024-06-04 17:01:32,858 INFO L125 PetriNetUnfolderBase]: For 4021/4021 co-relation queries the response was YES. [2024-06-04 17:01:32,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6891 conditions, 2119 events. 1368/2119 cut-off events. For 4021/4021 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10360 event pairs, 562 based on Foata normal form. 2/2099 useless extension candidates. Maximal degree in co-relation 6868. Up to 2036 conditions per place. [2024-06-04 17:01:32,872 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 50 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2024-06-04 17:01:32,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 437 flow [2024-06-04 17:01:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:01:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:01:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-04 17:01:32,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-04 17:01:32,874 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 293 flow. Second operand 5 states and 91 transitions. [2024-06-04 17:01:32,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 437 flow [2024-06-04 17:01:32,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 387 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 17:01:32,877 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 267 flow [2024-06-04 17:01:32,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-06-04 17:01:32,878 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-06-04 17:01:32,878 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 267 flow [2024-06-04 17:01:32,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 17:01:32,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:32,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:32,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:01:32,879 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 17:01:32,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1304420413, now seen corresponding path program 1 times [2024-06-04 17:01:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951987656] [2024-06-04 17:01:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:39,709 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 17:01:39,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951987656] [2024-06-04 17:01:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951987656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:39,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:39,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:01:39,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099211191] [2024-06-04 17:01:39,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:39,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:01:39,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:39,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:01:39,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:01:39,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:01:39,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 267 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 17:01:39,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:39,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:01:39,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:40,632 INFO L124 PetriNetUnfolderBase]: 1358/2141 cut-off events. [2024-06-04 17:01:40,633 INFO L125 PetriNetUnfolderBase]: For 4716/4716 co-relation queries the response was YES. [2024-06-04 17:01:40,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6909 conditions, 2141 events. 1358/2141 cut-off events. For 4716/4716 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10489 event pairs, 526 based on Foata normal form. 4/2135 useless extension candidates. Maximal degree in co-relation 6884. Up to 2004 conditions per place. [2024-06-04 17:01:40,647 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2024-06-04 17:01:40,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 457 flow [2024-06-04 17:01:40,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:01:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:01:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-04 17:01:40,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:01:40,652 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 267 flow. Second operand 6 states and 108 transitions. [2024-06-04 17:01:40,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 457 flow [2024-06-04 17:01:40,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 435 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:01:40,657 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 299 flow [2024-06-04 17:01:40,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-06-04 17:01:40,659 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2024-06-04 17:01:40,660 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 299 flow [2024-06-04 17:01:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 17:01:40,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:40,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:40,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:01:40,660 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 17:01:40,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1082209242, now seen corresponding path program 1 times [2024-06-04 17:01:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525209555] [2024-06-04 17:01:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:46,187 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 17:01:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525209555] [2024-06-04 17:01:46,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525209555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:46,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:46,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:01:46,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307267316] [2024-06-04 17:01:46,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:46,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:01:46,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:46,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:01:46,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:01:46,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:01:46,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:46,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:46,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:01:46,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:47,136 INFO L124 PetriNetUnfolderBase]: 1571/2366 cut-off events. [2024-06-04 17:01:47,136 INFO L125 PetriNetUnfolderBase]: For 7236/7242 co-relation queries the response was YES. [2024-06-04 17:01:47,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8341 conditions, 2366 events. 1571/2366 cut-off events. For 7236/7242 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11159 event pairs, 635 based on Foata normal form. 8/2371 useless extension candidates. Maximal degree in co-relation 8316. Up to 2253 conditions per place. [2024-06-04 17:01:47,152 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 55 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2024-06-04 17:01:47,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 543 flow [2024-06-04 17:01:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:01:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:01:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-04 17:01:47,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-04 17:01:47,154 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 299 flow. Second operand 6 states and 111 transitions. [2024-06-04 17:01:47,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 543 flow [2024-06-04 17:01:47,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 513 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:01:47,158 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 341 flow [2024-06-04 17:01:47,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-06-04 17:01:47,159 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-06-04 17:01:47,159 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 341 flow [2024-06-04 17:01:47,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:47,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:47,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:47,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:01:47,160 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 17:01:47,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1746584512, now seen corresponding path program 2 times [2024-06-04 17:01:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444038364] [2024-06-04 17:01:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:55,091 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 17:01:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:55,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444038364] [2024-06-04 17:01:55,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444038364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:55,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:55,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:01:55,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592454517] [2024-06-04 17:01:55,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:55,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:01:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:55,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:01:55,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:01:55,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:01:55,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 341 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:55,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:55,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:01:55,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:56,090 INFO L124 PetriNetUnfolderBase]: 1559/2339 cut-off events. [2024-06-04 17:01:56,090 INFO L125 PetriNetUnfolderBase]: For 8650/8654 co-relation queries the response was YES. [2024-06-04 17:01:56,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8510 conditions, 2339 events. 1559/2339 cut-off events. For 8650/8654 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10950 event pairs, 649 based on Foata normal form. 3/2335 useless extension candidates. Maximal degree in co-relation 8484. Up to 2237 conditions per place. [2024-06-04 17:01:56,102 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 49 selfloop transitions, 20 changer transitions 0/73 dead transitions. [2024-06-04 17:01:56,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 517 flow [2024-06-04 17:01:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:01:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:01:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 17:01:56,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-04 17:01:56,105 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 341 flow. Second operand 6 states and 107 transitions. [2024-06-04 17:01:56,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 517 flow [2024-06-04 17:01:56,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 488 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:01:56,109 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 360 flow [2024-06-04 17:01:56,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-06-04 17:01:56,111 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-06-04 17:01:56,111 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 360 flow [2024-06-04 17:01:56,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:56,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:56,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:56,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:01:56,112 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 17:01:56,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1366003396, now seen corresponding path program 1 times [2024-06-04 17:01:56,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:56,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286069968] [2024-06-04 17:01:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:04,399 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 17:02:04,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:04,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286069968] [2024-06-04 17:02:04,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286069968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:04,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:04,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:02:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376424590] [2024-06-04 17:02:04,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:04,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:02:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:04,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:02:04,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:02:04,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:02:04,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 17:02:04,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:04,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:02:04,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:05,520 INFO L124 PetriNetUnfolderBase]: 1733/2610 cut-off events. [2024-06-04 17:02:05,521 INFO L125 PetriNetUnfolderBase]: For 11532/11532 co-relation queries the response was YES. [2024-06-04 17:02:05,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9886 conditions, 2610 events. 1733/2610 cut-off events. For 11532/11532 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12474 event pairs, 547 based on Foata normal form. 8/2613 useless extension candidates. Maximal degree in co-relation 9859. Up to 2237 conditions per place. [2024-06-04 17:02:05,532 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 80 selfloop transitions, 39 changer transitions 0/123 dead transitions. [2024-06-04 17:02:05,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 123 transitions, 999 flow [2024-06-04 17:02:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:02:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:02:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-04 17:02:05,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-04 17:02:05,533 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 360 flow. Second operand 8 states and 154 transitions. [2024-06-04 17:02:05,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 123 transitions, 999 flow [2024-06-04 17:02:05,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 873 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:02:05,541 INFO L231 Difference]: Finished difference. Result has 69 places, 82 transitions, 581 flow [2024-06-04 17:02:05,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=581, PETRI_PLACES=69, PETRI_TRANSITIONS=82} [2024-06-04 17:02:05,542 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-04 17:02:05,542 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 82 transitions, 581 flow [2024-06-04 17:02:05,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 17:02:05,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:05,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:05,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:02:05,543 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 17:02:05,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1268731286, now seen corresponding path program 2 times [2024-06-04 17:02:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417737396] [2024-06-04 17:02:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:14,670 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 17:02:14,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:14,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417737396] [2024-06-04 17:02:14,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417737396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:14,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:14,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:02:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833291673] [2024-06-04 17:02:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:14,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:02:14,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:02:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:02:14,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:02:14,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 82 transitions, 581 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 17:02:14,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:14,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:02:14,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:15,903 INFO L124 PetriNetUnfolderBase]: 1805/2712 cut-off events. [2024-06-04 17:02:15,903 INFO L125 PetriNetUnfolderBase]: For 15092/15094 co-relation queries the response was YES. [2024-06-04 17:02:15,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11329 conditions, 2712 events. 1805/2712 cut-off events. For 15092/15094 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12906 event pairs, 568 based on Foata normal form. 12/2719 useless extension candidates. Maximal degree in co-relation 11298. Up to 2285 conditions per place. [2024-06-04 17:02:15,918 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 66 selfloop transitions, 48 changer transitions 0/118 dead transitions. [2024-06-04 17:02:15,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 1005 flow [2024-06-04 17:02:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:02:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:02:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-04 17:02:15,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-04 17:02:15,937 INFO L175 Difference]: Start difference. First operand has 69 places, 82 transitions, 581 flow. Second operand 7 states and 132 transitions. [2024-06-04 17:02:15,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 1005 flow [2024-06-04 17:02:15,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 118 transitions, 977 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-04 17:02:15,948 INFO L231 Difference]: Finished difference. Result has 74 places, 89 transitions, 734 flow [2024-06-04 17:02:15,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=734, PETRI_PLACES=74, PETRI_TRANSITIONS=89} [2024-06-04 17:02:15,948 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2024-06-04 17:02:15,948 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 89 transitions, 734 flow [2024-06-04 17:02:15,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 17:02:15,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:15,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:15,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:02:15,949 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 17:02:15,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1719949398, now seen corresponding path program 3 times [2024-06-04 17:02:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321799972] [2024-06-04 17:02:15,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:24,600 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 17:02:24,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:24,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321799972] [2024-06-04 17:02:24,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321799972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:24,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:24,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:02:24,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765113245] [2024-06-04 17:02:24,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:24,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:02:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:02:24,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:02:24,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:02:24,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 89 transitions, 734 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 17:02:24,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:24,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:02:24,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:25,829 INFO L124 PetriNetUnfolderBase]: 1841/2774 cut-off events. [2024-06-04 17:02:25,830 INFO L125 PetriNetUnfolderBase]: For 18384/18390 co-relation queries the response was YES. [2024-06-04 17:02:25,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12348 conditions, 2774 events. 1841/2774 cut-off events. For 18384/18390 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13330 event pairs, 569 based on Foata normal form. 7/2765 useless extension candidates. Maximal degree in co-relation 12315. Up to 2301 conditions per place. [2024-06-04 17:02:25,846 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 65 selfloop transitions, 58 changer transitions 0/127 dead transitions. [2024-06-04 17:02:25,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 127 transitions, 1268 flow [2024-06-04 17:02:25,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:02:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:02:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-04 17:02:25,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-04 17:02:25,867 INFO L175 Difference]: Start difference. First operand has 74 places, 89 transitions, 734 flow. Second operand 7 states and 133 transitions. [2024-06-04 17:02:25,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 127 transitions, 1268 flow [2024-06-04 17:02:25,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 127 transitions, 1152 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-04 17:02:25,884 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 878 flow [2024-06-04 17:02:25,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=878, PETRI_PLACES=77, PETRI_TRANSITIONS=99} [2024-06-04 17:02:25,885 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-06-04 17:02:25,885 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 878 flow [2024-06-04 17:02:25,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 17:02:25,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:25,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:25,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:02:25,886 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 17:02:25,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash 582237618, now seen corresponding path program 4 times [2024-06-04 17:02:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954669007] [2024-06-04 17:02:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:34,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954669007] [2024-06-04 17:02:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954669007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:34,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:02:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009673649] [2024-06-04 17:02:34,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:34,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:02:34,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:34,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:02:34,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:02:34,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:02:34,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 878 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 17:02:34,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:34,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:02:34,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:35,914 INFO L124 PetriNetUnfolderBase]: 1825/2744 cut-off events. [2024-06-04 17:02:35,914 INFO L125 PetriNetUnfolderBase]: For 18407/18413 co-relation queries the response was YES. [2024-06-04 17:02:35,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12132 conditions, 2744 events. 1825/2744 cut-off events. For 18407/18413 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13149 event pairs, 560 based on Foata normal form. 7/2737 useless extension candidates. Maximal degree in co-relation 12098. Up to 2294 conditions per place. [2024-06-04 17:02:35,927 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 61 selfloop transitions, 60 changer transitions 0/125 dead transitions. [2024-06-04 17:02:35,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1242 flow [2024-06-04 17:02:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:02:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:02:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-04 17:02:35,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-04 17:02:35,930 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 878 flow. Second operand 7 states and 130 transitions. [2024-06-04 17:02:35,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1242 flow [2024-06-04 17:02:35,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 125 transitions, 1155 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-06-04 17:02:35,945 INFO L231 Difference]: Finished difference. Result has 82 places, 99 transitions, 921 flow [2024-06-04 17:02:35,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=921, PETRI_PLACES=82, PETRI_TRANSITIONS=99} [2024-06-04 17:02:35,946 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2024-06-04 17:02:35,946 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 99 transitions, 921 flow [2024-06-04 17:02:35,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 17:02:35,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:35,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:35,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:02:35,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:02:35,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash 582477186, now seen corresponding path program 1 times [2024-06-04 17:02:35,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507478586] [2024-06-04 17:02:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:44,100 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 17:02:44,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:44,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507478586] [2024-06-04 17:02:44,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507478586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:44,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:44,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:02:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344123991] [2024-06-04 17:02:44,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:44,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:02:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:02:44,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:02:44,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:02:44,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 99 transitions, 921 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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 17:02:44,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:44,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:02:44,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:45,085 INFO L124 PetriNetUnfolderBase]: 1610/2521 cut-off events. [2024-06-04 17:02:45,086 INFO L125 PetriNetUnfolderBase]: For 17755/17757 co-relation queries the response was YES. [2024-06-04 17:02:45,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11271 conditions, 2521 events. 1610/2521 cut-off events. For 17755/17757 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 12465 event pairs, 527 based on Foata normal form. 4/2507 useless extension candidates. Maximal degree in co-relation 11234. Up to 2349 conditions per place. [2024-06-04 17:02:45,099 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 104 selfloop transitions, 13 changer transitions 0/122 dead transitions. [2024-06-04 17:02:45,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 122 transitions, 1239 flow [2024-06-04 17:02:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:02:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:02:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 17:02:45,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2024-06-04 17:02:45,101 INFO L175 Difference]: Start difference. First operand has 82 places, 99 transitions, 921 flow. Second operand 7 states and 124 transitions. [2024-06-04 17:02:45,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 122 transitions, 1239 flow [2024-06-04 17:02:45,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 1087 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 17:02:45,117 INFO L231 Difference]: Finished difference. Result has 82 places, 101 transitions, 828 flow [2024-06-04 17:02:45,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=828, PETRI_PLACES=82, PETRI_TRANSITIONS=101} [2024-06-04 17:02:45,118 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2024-06-04 17:02:45,118 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 101 transitions, 828 flow [2024-06-04 17:02:45,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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 17:02:45,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:45,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:45,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:02:45,119 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:02:45,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 659927372, now seen corresponding path program 1 times [2024-06-04 17:02:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685662821] [2024-06-04 17:02:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:45,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685662821] [2024-06-04 17:02:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685662821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:02:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900875116] [2024-06-04 17:02:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:53,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:02:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:02:53,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:02:53,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:02:53,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 101 transitions, 828 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:53,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:53,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:02:53,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:54,274 INFO L124 PetriNetUnfolderBase]: 1607/2508 cut-off events. [2024-06-04 17:02:54,275 INFO L125 PetriNetUnfolderBase]: For 18812/18814 co-relation queries the response was YES. [2024-06-04 17:02:54,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11102 conditions, 2508 events. 1607/2508 cut-off events. For 18812/18814 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12329 event pairs, 554 based on Foata normal form. 1/2507 useless extension candidates. Maximal degree in co-relation 11065. Up to 2387 conditions per place. [2024-06-04 17:02:54,286 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 99 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2024-06-04 17:02:54,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 112 transitions, 1088 flow [2024-06-04 17:02:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:02:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:02:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-04 17:02:54,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-04 17:02:54,287 INFO L175 Difference]: Start difference. First operand has 82 places, 101 transitions, 828 flow. Second operand 5 states and 87 transitions. [2024-06-04 17:02:54,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 112 transitions, 1088 flow [2024-06-04 17:02:54,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 1047 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 17:02:54,314 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 837 flow [2024-06-04 17:02:54,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=837, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2024-06-04 17:02:54,321 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2024-06-04 17:02:54,321 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 837 flow [2024-06-04 17:02:54,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:54,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:54,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:54,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:02:54,322 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 17:02:54,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 621032788, now seen corresponding path program 1 times [2024-06-04 17:02:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835839899] [2024-06-04 17:02:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835839899] [2024-06-04 17:02:59,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835839899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:59,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:59,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:02:59,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248614597] [2024-06-04 17:02:59,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:59,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:02:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:59,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:02:59,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:02:59,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:02:59,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 837 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:59,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:59,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:02:59,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:00,601 INFO L124 PetriNetUnfolderBase]: 1858/2821 cut-off events. [2024-06-04 17:03:00,601 INFO L125 PetriNetUnfolderBase]: For 25346/25352 co-relation queries the response was YES. [2024-06-04 17:03:00,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13011 conditions, 2821 events. 1858/2821 cut-off events. For 25346/25352 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13706 event pairs, 572 based on Foata normal form. 14/2830 useless extension candidates. Maximal degree in co-relation 12973. Up to 2316 conditions per place. [2024-06-04 17:03:00,615 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 75 selfloop transitions, 63 changer transitions 0/142 dead transitions. [2024-06-04 17:03:00,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 142 transitions, 1339 flow [2024-06-04 17:03:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:03:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:03:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-04 17:03:00,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-04 17:03:00,619 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 837 flow. Second operand 7 states and 136 transitions. [2024-06-04 17:03:00,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 142 transitions, 1339 flow [2024-06-04 17:03:00,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 142 transitions, 1311 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-04 17:03:00,643 INFO L231 Difference]: Finished difference. Result has 86 places, 110 transitions, 1022 flow [2024-06-04 17:03:00,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1022, PETRI_PLACES=86, PETRI_TRANSITIONS=110} [2024-06-04 17:03:00,644 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2024-06-04 17:03:00,645 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 110 transitions, 1022 flow [2024-06-04 17:03:00,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:00,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:00,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:00,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:03:00,645 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 17:03:00,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash 675965348, now seen corresponding path program 2 times [2024-06-04 17:03:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:00,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671790943] [2024-06-04 17:03:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:00,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:09,355 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 17:03:09,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:09,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671790943] [2024-06-04 17:03:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671790943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:03:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108326214] [2024-06-04 17:03:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:09,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:03:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:09,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:03:09,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:03:09,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:03:09,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 110 transitions, 1022 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:09,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:09,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:03:09,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:10,612 INFO L124 PetriNetUnfolderBase]: 1890/2875 cut-off events. [2024-06-04 17:03:10,613 INFO L125 PetriNetUnfolderBase]: For 29604/29606 co-relation queries the response was YES. [2024-06-04 17:03:10,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13907 conditions, 2875 events. 1890/2875 cut-off events. For 29604/29606 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14046 event pairs, 558 based on Foata normal form. 8/2878 useless extension candidates. Maximal degree in co-relation 13868. Up to 2345 conditions per place. [2024-06-04 17:03:10,630 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 76 selfloop transitions, 65 changer transitions 0/145 dead transitions. [2024-06-04 17:03:10,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 145 transitions, 1534 flow [2024-06-04 17:03:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:03:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:03:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-04 17:03:10,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-04 17:03:10,633 INFO L175 Difference]: Start difference. First operand has 86 places, 110 transitions, 1022 flow. Second operand 7 states and 132 transitions. [2024-06-04 17:03:10,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 145 transitions, 1534 flow [2024-06-04 17:03:10,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 145 transitions, 1319 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 17:03:10,653 INFO L231 Difference]: Finished difference. Result has 87 places, 116 transitions, 1038 flow [2024-06-04 17:03:10,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1038, PETRI_PLACES=87, PETRI_TRANSITIONS=116} [2024-06-04 17:03:10,654 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2024-06-04 17:03:10,654 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 116 transitions, 1038 flow [2024-06-04 17:03:10,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:10,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:10,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:10,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:03:10,657 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 17:03:10,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 871890792, now seen corresponding path program 3 times [2024-06-04 17:03:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378443863] [2024-06-04 17:03:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:19,565 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 17:03:19,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:19,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378443863] [2024-06-04 17:03:19,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378443863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:19,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:19,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:03:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491400412] [2024-06-04 17:03:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:19,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:03:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:03:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:03:19,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:03:19,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 116 transitions, 1038 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:19,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:19,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:03:19,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:20,715 INFO L124 PetriNetUnfolderBase]: 1874/2853 cut-off events. [2024-06-04 17:03:20,715 INFO L125 PetriNetUnfolderBase]: For 30799/30808 co-relation queries the response was YES. [2024-06-04 17:03:20,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13810 conditions, 2853 events. 1874/2853 cut-off events. For 30799/30808 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13903 event pairs, 576 based on Foata normal form. 9/2850 useless extension candidates. Maximal degree in co-relation 13771. Up to 2332 conditions per place. [2024-06-04 17:03:20,728 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 73 selfloop transitions, 62 changer transitions 0/139 dead transitions. [2024-06-04 17:03:20,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 139 transitions, 1382 flow [2024-06-04 17:03:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:03:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:03:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-04 17:03:20,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-04 17:03:20,729 INFO L175 Difference]: Start difference. First operand has 87 places, 116 transitions, 1038 flow. Second operand 7 states and 125 transitions. [2024-06-04 17:03:20,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 139 transitions, 1382 flow [2024-06-04 17:03:20,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 139 transitions, 1244 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-04 17:03:20,748 INFO L231 Difference]: Finished difference. Result has 90 places, 116 transitions, 1035 flow [2024-06-04 17:03:20,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1035, PETRI_PLACES=90, PETRI_TRANSITIONS=116} [2024-06-04 17:03:20,749 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2024-06-04 17:03:20,749 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 116 transitions, 1035 flow [2024-06-04 17:03:20,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:20,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:20,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:20,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:03:20,750 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:03:20,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1017086490, now seen corresponding path program 1 times [2024-06-04 17:03:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133367648] [2024-06-04 17:03:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:30,072 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 17:03:30,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:30,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133367648] [2024-06-04 17:03:30,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133367648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:30,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:30,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:03:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314976624] [2024-06-04 17:03:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:30,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:03:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:30,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:03:30,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:03:30,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:03:30,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 116 transitions, 1035 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:03:30,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:30,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:03:30,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:31,028 INFO L124 PetriNetUnfolderBase]: 1664/2626 cut-off events. [2024-06-04 17:03:31,029 INFO L125 PetriNetUnfolderBase]: For 28686/28688 co-relation queries the response was YES. [2024-06-04 17:03:31,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12622 conditions, 2626 events. 1664/2626 cut-off events. For 28686/28688 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13200 event pairs, 581 based on Foata normal form. 1/2625 useless extension candidates. Maximal degree in co-relation 12582. Up to 2468 conditions per place. [2024-06-04 17:03:31,044 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 112 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2024-06-04 17:03:31,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 128 transitions, 1333 flow [2024-06-04 17:03:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:03:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:03:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-04 17:03:31,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2024-06-04 17:03:31,045 INFO L175 Difference]: Start difference. First operand has 90 places, 116 transitions, 1035 flow. Second operand 6 states and 100 transitions. [2024-06-04 17:03:31,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 128 transitions, 1333 flow [2024-06-04 17:03:31,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 128 transitions, 1150 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:03:31,069 INFO L231 Difference]: Finished difference. Result has 89 places, 119 transitions, 912 flow [2024-06-04 17:03:31,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=89, PETRI_TRANSITIONS=119} [2024-06-04 17:03:31,070 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2024-06-04 17:03:31,070 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 119 transitions, 912 flow [2024-06-04 17:03:31,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:03:31,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:31,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:31,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:03:31,070 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:03:31,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -638235399, now seen corresponding path program 1 times [2024-06-04 17:03:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882244288] [2024-06-04 17:03:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:40,314 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 17:03:40,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:40,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882244288] [2024-06-04 17:03:40,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882244288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:40,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:40,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:03:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604929497] [2024-06-04 17:03:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:40,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:03:40,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:40,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:03:40,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:03:40,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:03:40,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 119 transitions, 912 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:40,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:40,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:03:40,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:41,562 INFO L124 PetriNetUnfolderBase]: 1885/2867 cut-off events. [2024-06-04 17:03:41,562 INFO L125 PetriNetUnfolderBase]: For 35410/35415 co-relation queries the response was YES. [2024-06-04 17:03:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14013 conditions, 2867 events. 1885/2867 cut-off events. For 35410/35415 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13958 event pairs, 445 based on Foata normal form. 6/2870 useless extension candidates. Maximal degree in co-relation 13972. Up to 2545 conditions per place. [2024-06-04 17:03:41,575 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 113 selfloop transitions, 32 changer transitions 0/149 dead transitions. [2024-06-04 17:03:41,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 149 transitions, 1388 flow [2024-06-04 17:03:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:03:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:03:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-04 17:03:41,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:03:41,578 INFO L175 Difference]: Start difference. First operand has 89 places, 119 transitions, 912 flow. Second operand 7 states and 126 transitions. [2024-06-04 17:03:41,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 149 transitions, 1388 flow [2024-06-04 17:03:41,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 149 transitions, 1350 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 17:03:41,600 INFO L231 Difference]: Finished difference. Result has 92 places, 123 transitions, 993 flow [2024-06-04 17:03:41,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=993, PETRI_PLACES=92, PETRI_TRANSITIONS=123} [2024-06-04 17:03:41,601 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2024-06-04 17:03:41,601 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 123 transitions, 993 flow [2024-06-04 17:03:41,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:41,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:41,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:41,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:03:41,602 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 17:03:41,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1956852477, now seen corresponding path program 2 times [2024-06-04 17:03:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998092920] [2024-06-04 17:03:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:47,104 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 17:03:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998092920] [2024-06-04 17:03:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998092920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:03:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081002325] [2024-06-04 17:03:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:47,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:03:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:03:47,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:03:47,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:03:47,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 123 transitions, 993 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:47,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:47,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:03:47,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:48,190 INFO L124 PetriNetUnfolderBase]: 1937/2951 cut-off events. [2024-06-04 17:03:48,191 INFO L125 PetriNetUnfolderBase]: For 40312/40317 co-relation queries the response was YES. [2024-06-04 17:03:48,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14932 conditions, 2951 events. 1937/2951 cut-off events. For 40312/40317 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14371 event pairs, 593 based on Foata normal form. 8/2952 useless extension candidates. Maximal degree in co-relation 14890. Up to 2690 conditions per place. [2024-06-04 17:03:48,208 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 113 selfloop transitions, 43 changer transitions 0/160 dead transitions. [2024-06-04 17:03:48,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 160 transitions, 1544 flow [2024-06-04 17:03:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:03:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:03:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-04 17:03:48,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-04 17:03:48,211 INFO L175 Difference]: Start difference. First operand has 92 places, 123 transitions, 993 flow. Second operand 8 states and 135 transitions. [2024-06-04 17:03:48,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 160 transitions, 1544 flow [2024-06-04 17:03:48,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 160 transitions, 1476 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-04 17:03:48,237 INFO L231 Difference]: Finished difference. Result has 101 places, 138 transitions, 1247 flow [2024-06-04 17:03:48,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1247, PETRI_PLACES=101, PETRI_TRANSITIONS=138} [2024-06-04 17:03:48,238 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2024-06-04 17:03:48,238 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 138 transitions, 1247 flow [2024-06-04 17:03:48,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:48,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:48,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:48,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:03:48,239 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 17:03:48,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash -519902571, now seen corresponding path program 1 times [2024-06-04 17:03:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:48,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18628519] [2024-06-04 17:03:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:56,539 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 17:03:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18628519] [2024-06-04 17:03:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18628519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:03:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478315859] [2024-06-04 17:03:56,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:56,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:03:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:03:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:03:56,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:03:56,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 138 transitions, 1247 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:03:56,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:56,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:03:56,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:57,857 INFO L124 PetriNetUnfolderBase]: 2029/3095 cut-off events. [2024-06-04 17:03:57,858 INFO L125 PetriNetUnfolderBase]: For 48453/48455 co-relation queries the response was YES. [2024-06-04 17:03:57,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16073 conditions, 3095 events. 2029/3095 cut-off events. For 48453/48455 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15341 event pairs, 439 based on Foata normal form. 24/3114 useless extension candidates. Maximal degree in co-relation 16025. Up to 2379 conditions per place. [2024-06-04 17:03:57,874 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 89 selfloop transitions, 81 changer transitions 0/174 dead transitions. [2024-06-04 17:03:57,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 174 transitions, 1721 flow [2024-06-04 17:03:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:03:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:03:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-04 17:03:57,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-04 17:03:57,878 INFO L175 Difference]: Start difference. First operand has 101 places, 138 transitions, 1247 flow. Second operand 8 states and 149 transitions. [2024-06-04 17:03:57,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 174 transitions, 1721 flow [2024-06-04 17:03:57,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 174 transitions, 1658 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 17:03:57,909 INFO L231 Difference]: Finished difference. Result has 106 places, 140 transitions, 1388 flow [2024-06-04 17:03:57,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1388, PETRI_PLACES=106, PETRI_TRANSITIONS=140} [2024-06-04 17:03:57,910 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-06-04 17:03:57,910 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 140 transitions, 1388 flow [2024-06-04 17:03:57,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:03:57,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:57,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:57,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:03:57,911 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 17:03:57,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1476350357, now seen corresponding path program 1 times [2024-06-04 17:03:57,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:57,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041487686] [2024-06-04 17:03:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:06,188 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 17:04:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:06,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041487686] [2024-06-04 17:04:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041487686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:06,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:04:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092723493] [2024-06-04 17:04:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:06,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:04:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:06,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:04:06,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:04:06,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:04:06,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 140 transitions, 1388 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 17:04:06,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:06,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:04:06,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:07,248 INFO L124 PetriNetUnfolderBase]: 2034/3118 cut-off events. [2024-06-04 17:04:07,248 INFO L125 PetriNetUnfolderBase]: For 49940/49948 co-relation queries the response was YES. [2024-06-04 17:04:07,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16789 conditions, 3118 events. 2034/3118 cut-off events. For 49940/49948 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15526 event pairs, 606 based on Foata normal form. 9/3125 useless extension candidates. Maximal degree in co-relation 16739. Up to 3001 conditions per place. [2024-06-04 17:04:07,275 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 138 selfloop transitions, 16 changer transitions 0/158 dead transitions. [2024-06-04 17:04:07,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 158 transitions, 1778 flow [2024-06-04 17:04:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:04:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:04:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-04 17:04:07,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4007936507936508 [2024-06-04 17:04:07,277 INFO L175 Difference]: Start difference. First operand has 106 places, 140 transitions, 1388 flow. Second operand 6 states and 101 transitions. [2024-06-04 17:04:07,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 158 transitions, 1778 flow [2024-06-04 17:04:07,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 158 transitions, 1608 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:04:07,343 INFO L231 Difference]: Finished difference. Result has 106 places, 143 transitions, 1292 flow [2024-06-04 17:04:07,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1292, PETRI_PLACES=106, PETRI_TRANSITIONS=143} [2024-06-04 17:04:07,344 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-06-04 17:04:07,344 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 143 transitions, 1292 flow [2024-06-04 17:04:07,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 17:04:07,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:07,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:07,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:04:07,345 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:04:07,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:07,345 INFO L85 PathProgramCache]: Analyzing trace with hash -348007327, now seen corresponding path program 2 times [2024-06-04 17:04:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758668287] [2024-06-04 17:04:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:15,795 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 17:04:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758668287] [2024-06-04 17:04:15,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758668287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:15,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:15,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:04:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901409275] [2024-06-04 17:04:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:15,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:04:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:04:15,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:04:15,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:04:15,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 143 transitions, 1292 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:04:15,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:15,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:04:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:17,086 INFO L124 PetriNetUnfolderBase]: 2051/3115 cut-off events. [2024-06-04 17:04:17,086 INFO L125 PetriNetUnfolderBase]: For 54180/54182 co-relation queries the response was YES. [2024-06-04 17:04:17,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16882 conditions, 3115 events. 2051/3115 cut-off events. For 54180/54182 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15308 event pairs, 500 based on Foata normal form. 4/3094 useless extension candidates. Maximal degree in co-relation 16831. Up to 2562 conditions per place. [2024-06-04 17:04:17,104 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 85 selfloop transitions, 84 changer transitions 0/173 dead transitions. [2024-06-04 17:04:17,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 173 transitions, 1750 flow [2024-06-04 17:04:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:04:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:04:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 17:04:17,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-04 17:04:17,107 INFO L175 Difference]: Start difference. First operand has 106 places, 143 transitions, 1292 flow. Second operand 8 states and 143 transitions. [2024-06-04 17:04:17,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 173 transitions, 1750 flow [2024-06-04 17:04:17,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 173 transitions, 1702 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 17:04:17,140 INFO L231 Difference]: Finished difference. Result has 110 places, 145 transitions, 1456 flow [2024-06-04 17:04:17,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1456, PETRI_PLACES=110, PETRI_TRANSITIONS=145} [2024-06-04 17:04:17,141 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-04 17:04:17,141 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 145 transitions, 1456 flow [2024-06-04 17:04:17,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:04:17,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:17,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:17,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:04:17,142 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:04:17,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1858731661, now seen corresponding path program 3 times [2024-06-04 17:04:17,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:17,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635127647] [2024-06-04 17:04:17,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:25,825 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 17:04:25,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:25,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635127647] [2024-06-04 17:04:25,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635127647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:25,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:25,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:04:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703322013] [2024-06-04 17:04:25,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:25,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:04:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:25,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:04:25,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:04:25,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:04:26,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 145 transitions, 1456 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:04:26,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:26,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:04:26,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:27,133 INFO L124 PetriNetUnfolderBase]: 2068/3142 cut-off events. [2024-06-04 17:04:27,133 INFO L125 PetriNetUnfolderBase]: For 61041/61043 co-relation queries the response was YES. [2024-06-04 17:04:27,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17842 conditions, 3142 events. 2068/3142 cut-off events. For 61041/61043 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15540 event pairs, 369 based on Foata normal form. 4/3121 useless extension candidates. Maximal degree in co-relation 17790. Up to 2351 conditions per place. [2024-06-04 17:04:27,150 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 88 selfloop transitions, 91 changer transitions 0/183 dead transitions. [2024-06-04 17:04:27,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 183 transitions, 2074 flow [2024-06-04 17:04:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:04:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:04:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-04 17:04:27,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-04 17:04:27,153 INFO L175 Difference]: Start difference. First operand has 110 places, 145 transitions, 1456 flow. Second operand 8 states and 149 transitions. [2024-06-04 17:04:27,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 183 transitions, 2074 flow [2024-06-04 17:04:27,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 183 transitions, 1882 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 17:04:27,215 INFO L231 Difference]: Finished difference. Result has 112 places, 149 transitions, 1529 flow [2024-06-04 17:04:27,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1529, PETRI_PLACES=112, PETRI_TRANSITIONS=149} [2024-06-04 17:04:27,218 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 69 predicate places. [2024-06-04 17:04:27,219 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 149 transitions, 1529 flow [2024-06-04 17:04:27,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:04:27,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:27,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:27,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:04:27,219 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:04:27,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2095203691, now seen corresponding path program 4 times [2024-06-04 17:04:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:27,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692353852] [2024-06-04 17:04:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:35,184 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 17:04:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692353852] [2024-06-04 17:04:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692353852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:35,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:04:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101958722] [2024-06-04 17:04:35,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:35,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:04:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:35,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:04:35,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:04:35,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:04:35,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 149 transitions, 1529 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:04:35,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:35,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:04:35,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:36,491 INFO L124 PetriNetUnfolderBase]: 2060/3134 cut-off events. [2024-06-04 17:04:36,491 INFO L125 PetriNetUnfolderBase]: For 65254/65256 co-relation queries the response was YES. [2024-06-04 17:04:36,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18038 conditions, 3134 events. 2060/3134 cut-off events. For 65254/65256 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15469 event pairs, 510 based on Foata normal form. 4/3113 useless extension candidates. Maximal degree in co-relation 17985. Up to 2577 conditions per place. [2024-06-04 17:04:36,512 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 92 selfloop transitions, 81 changer transitions 0/177 dead transitions. [2024-06-04 17:04:36,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 177 transitions, 1961 flow [2024-06-04 17:04:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:04:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:04:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 17:04:36,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:04:36,515 INFO L175 Difference]: Start difference. First operand has 112 places, 149 transitions, 1529 flow. Second operand 8 states and 144 transitions. [2024-06-04 17:04:36,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 177 transitions, 1961 flow [2024-06-04 17:04:36,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 177 transitions, 1749 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-04 17:04:36,580 INFO L231 Difference]: Finished difference. Result has 115 places, 149 transitions, 1487 flow [2024-06-04 17:04:36,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1487, PETRI_PLACES=115, PETRI_TRANSITIONS=149} [2024-06-04 17:04:36,580 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-04 17:04:36,580 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 149 transitions, 1487 flow [2024-06-04 17:04:36,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:04:36,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:36,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:36,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:04:36,581 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:04:36,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1464922517, now seen corresponding path program 2 times [2024-06-04 17:04:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:36,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110197907] [2024-06-04 17:04:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:45,135 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 17:04:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110197907] [2024-06-04 17:04:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110197907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:45,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:45,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:04:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542137044] [2024-06-04 17:04:45,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:45,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:04:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:04:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:04:45,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:04:45,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 149 transitions, 1487 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 17:04:45,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:45,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:04:45,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:46,074 INFO L124 PetriNetUnfolderBase]: 2057/3157 cut-off events. [2024-06-04 17:04:46,074 INFO L125 PetriNetUnfolderBase]: For 67761/67774 co-relation queries the response was YES. [2024-06-04 17:04:46,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17962 conditions, 3157 events. 2057/3157 cut-off events. For 67761/67774 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15816 event pairs, 614 based on Foata normal form. 11/3163 useless extension candidates. Maximal degree in co-relation 17908. Up to 3033 conditions per place. [2024-06-04 17:04:46,097 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 138 selfloop transitions, 20 changer transitions 0/162 dead transitions. [2024-06-04 17:04:46,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 162 transitions, 1877 flow [2024-06-04 17:04:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:04:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:04:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-04 17:04:46,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38492063492063494 [2024-06-04 17:04:46,098 INFO L175 Difference]: Start difference. First operand has 115 places, 149 transitions, 1487 flow. Second operand 6 states and 97 transitions. [2024-06-04 17:04:46,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 162 transitions, 1877 flow [2024-06-04 17:04:46,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 162 transitions, 1684 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:46,162 INFO L231 Difference]: Finished difference. Result has 114 places, 152 transitions, 1382 flow [2024-06-04 17:04:46,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1382, PETRI_PLACES=114, PETRI_TRANSITIONS=152} [2024-06-04 17:04:46,163 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-04 17:04:46,163 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 152 transitions, 1382 flow [2024-06-04 17:04:46,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 17:04:46,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:46,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:46,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:04:46,164 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 17:04:46,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:46,164 INFO L85 PathProgramCache]: Analyzing trace with hash -782529543, now seen corresponding path program 3 times [2024-06-04 17:04:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:46,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690898166] [2024-06-04 17:04:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:54,547 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 17:04:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690898166] [2024-06-04 17:04:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690898166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:04:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628660599] [2024-06-04 17:04:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:54,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:04:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:04:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:04:54,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:04:54,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 152 transitions, 1382 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:54,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:54,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:04:54,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:55,854 INFO L124 PetriNetUnfolderBase]: 2060/3146 cut-off events. [2024-06-04 17:04:55,854 INFO L125 PetriNetUnfolderBase]: For 71142/71147 co-relation queries the response was YES. [2024-06-04 17:04:55,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17813 conditions, 3146 events. 2060/3146 cut-off events. For 71142/71147 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15620 event pairs, 582 based on Foata normal form. 8/3151 useless extension candidates. Maximal degree in co-relation 17758. Up to 2888 conditions per place. [2024-06-04 17:04:55,878 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 133 selfloop transitions, 49 changer transitions 0/186 dead transitions. [2024-06-04 17:04:55,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 186 transitions, 1894 flow [2024-06-04 17:04:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:04:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:04:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 17:04:55,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-04 17:04:55,882 INFO L175 Difference]: Start difference. First operand has 114 places, 152 transitions, 1382 flow. Second operand 8 states and 142 transitions. [2024-06-04 17:04:55,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 186 transitions, 1894 flow [2024-06-04 17:04:55,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 186 transitions, 1818 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-04 17:04:55,961 INFO L231 Difference]: Finished difference. Result has 119 places, 158 transitions, 1486 flow [2024-06-04 17:04:55,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1486, PETRI_PLACES=119, PETRI_TRANSITIONS=158} [2024-06-04 17:04:55,962 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2024-06-04 17:04:55,962 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 158 transitions, 1486 flow [2024-06-04 17:04:55,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:55,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:55,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:55,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:04:55,963 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:04:55,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 422052267, now seen corresponding path program 1 times [2024-06-04 17:04:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:55,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149958815] [2024-06-04 17:04:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:04,509 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 17:05:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149958815] [2024-06-04 17:05:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149958815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:05:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852454820] [2024-06-04 17:05:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:04,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:05:04,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:05:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:05:04,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:05:04,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 158 transitions, 1486 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:05:04,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:04,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:05:04,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:05,455 INFO L124 PetriNetUnfolderBase]: 1861/2924 cut-off events. [2024-06-04 17:05:05,455 INFO L125 PetriNetUnfolderBase]: For 64306/64308 co-relation queries the response was YES. [2024-06-04 17:05:05,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16566 conditions, 2924 events. 1861/2924 cut-off events. For 64306/64308 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15028 event pairs, 566 based on Foata normal form. 1/2923 useless extension candidates. Maximal degree in co-relation 16509. Up to 2775 conditions per place. [2024-06-04 17:05:05,475 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 154 selfloop transitions, 13 changer transitions 0/172 dead transitions. [2024-06-04 17:05:05,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 172 transitions, 1882 flow [2024-06-04 17:05:05,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:05:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:05:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-04 17:05:05,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2024-06-04 17:05:05,477 INFO L175 Difference]: Start difference. First operand has 119 places, 158 transitions, 1486 flow. Second operand 7 states and 113 transitions. [2024-06-04 17:05:05,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 172 transitions, 1882 flow [2024-06-04 17:05:05,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 172 transitions, 1805 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 17:05:05,525 INFO L231 Difference]: Finished difference. Result has 121 places, 161 transitions, 1477 flow [2024-06-04 17:05:05,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1477, PETRI_PLACES=121, PETRI_TRANSITIONS=161} [2024-06-04 17:05:05,526 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places. [2024-06-04 17:05:05,526 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 161 transitions, 1477 flow [2024-06-04 17:05:05,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:05:05,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:05,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:05,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:05:05,526 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 17:05:05,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:05,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1464916565, now seen corresponding path program 2 times [2024-06-04 17:05:05,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:05,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338115399] [2024-06-04 17:05:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:05,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:14,021 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 17:05:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338115399] [2024-06-04 17:05:14,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338115399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:14,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:14,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:05:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307107220] [2024-06-04 17:05:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:14,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:05:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:14,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:05:14,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:05:14,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:05:14,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 161 transitions, 1477 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:14,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:14,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:05:14,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:14,987 INFO L124 PetriNetUnfolderBase]: 1858/2921 cut-off events. [2024-06-04 17:05:14,987 INFO L125 PetriNetUnfolderBase]: For 67208/67213 co-relation queries the response was YES. [2024-06-04 17:05:14,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16720 conditions, 2921 events. 1858/2921 cut-off events. For 67208/67213 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15002 event pairs, 570 based on Foata normal form. 3/2921 useless extension candidates. Maximal degree in co-relation 16662. Up to 2765 conditions per place. [2024-06-04 17:05:15,009 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 150 selfloop transitions, 17 changer transitions 0/172 dead transitions. [2024-06-04 17:05:15,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 172 transitions, 1869 flow [2024-06-04 17:05:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:05:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:05:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-04 17:05:15,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-04 17:05:15,011 INFO L175 Difference]: Start difference. First operand has 121 places, 161 transitions, 1477 flow. Second operand 6 states and 102 transitions. [2024-06-04 17:05:15,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 172 transitions, 1869 flow [2024-06-04 17:05:15,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 172 transitions, 1807 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-04 17:05:15,060 INFO L231 Difference]: Finished difference. Result has 122 places, 164 transitions, 1497 flow [2024-06-04 17:05:15,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1497, PETRI_PLACES=122, PETRI_TRANSITIONS=164} [2024-06-04 17:05:15,062 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2024-06-04 17:05:15,062 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 164 transitions, 1497 flow [2024-06-04 17:05:15,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:15,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:15,063 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 17:05:15,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:05:15,064 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 17:05:15,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1778106203, now seen corresponding path program 1 times [2024-06-04 17:05:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:15,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535675569] [2024-06-04 17:05:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:24,987 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 17:05:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535675569] [2024-06-04 17:05:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535675569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:05:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915891342] [2024-06-04 17:05:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:24,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:05:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:05:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:05:25,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:05:25,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 164 transitions, 1497 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:05:25,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:25,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:05:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:26,239 INFO L124 PetriNetUnfolderBase]: 2120/3248 cut-off events. [2024-06-04 17:05:26,239 INFO L125 PetriNetUnfolderBase]: For 91716/91718 co-relation queries the response was YES. [2024-06-04 17:05:26,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19274 conditions, 3248 events. 2120/3248 cut-off events. For 91716/91718 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16348 event pairs, 438 based on Foata normal form. 16/3259 useless extension candidates. Maximal degree in co-relation 19216. Up to 2373 conditions per place. [2024-06-04 17:05:26,310 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 114 selfloop transitions, 85 changer transitions 0/203 dead transitions. [2024-06-04 17:05:26,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 203 transitions, 2044 flow [2024-06-04 17:05:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:05:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:05:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-04 17:05:26,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-04 17:05:26,313 INFO L175 Difference]: Start difference. First operand has 122 places, 164 transitions, 1497 flow. Second operand 8 states and 152 transitions. [2024-06-04 17:05:26,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 203 transitions, 2044 flow [2024-06-04 17:05:26,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 203 transitions, 1984 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 17:05:26,379 INFO L231 Difference]: Finished difference. Result has 126 places, 165 transitions, 1641 flow [2024-06-04 17:05:26,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1641, PETRI_PLACES=126, PETRI_TRANSITIONS=165} [2024-06-04 17:05:26,380 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2024-06-04 17:05:26,380 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 165 transitions, 1641 flow [2024-06-04 17:05:26,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:05:26,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:26,381 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 17:05:26,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:05:26,381 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 17:05:26,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1689540443, now seen corresponding path program 2 times [2024-06-04 17:05:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700602326] [2024-06-04 17:05:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:35,608 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 17:05:35,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:35,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700602326] [2024-06-04 17:05:35,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700602326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:35,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:35,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:05:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174602400] [2024-06-04 17:05:35,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:35,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:05:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:05:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:05:35,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:05:35,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 165 transitions, 1641 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:05:35,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:35,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:05:35,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:36,923 INFO L124 PetriNetUnfolderBase]: 2239/3464 cut-off events. [2024-06-04 17:05:36,923 INFO L125 PetriNetUnfolderBase]: For 105358/105360 co-relation queries the response was YES. [2024-06-04 17:05:36,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21167 conditions, 3464 events. 2239/3464 cut-off events. For 105358/105360 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 17893 event pairs, 425 based on Foata normal form. 16/3475 useless extension candidates. Maximal degree in co-relation 21108. Up to 2077 conditions per place. [2024-06-04 17:05:36,947 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 123 selfloop transitions, 78 changer transitions 0/205 dead transitions. [2024-06-04 17:05:36,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 205 transitions, 2311 flow [2024-06-04 17:05:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:05:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:05:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-04 17:05:36,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-04 17:05:36,950 INFO L175 Difference]: Start difference. First operand has 126 places, 165 transitions, 1641 flow. Second operand 8 states and 152 transitions. [2024-06-04 17:05:36,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 205 transitions, 2311 flow [2024-06-04 17:05:37,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 205 transitions, 2127 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:05:37,012 INFO L231 Difference]: Finished difference. Result has 128 places, 167 transitions, 1673 flow [2024-06-04 17:05:37,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1673, PETRI_PLACES=128, PETRI_TRANSITIONS=167} [2024-06-04 17:05:37,013 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places. [2024-06-04 17:05:37,013 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 167 transitions, 1673 flow [2024-06-04 17:05:37,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:05:37,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:37,013 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 17:05:37,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:05:37,013 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:05:37,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1477481745, now seen corresponding path program 1 times [2024-06-04 17:05:37,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359060026] [2024-06-04 17:05:37,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:45,626 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 17:05:45,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359060026] [2024-06-04 17:05:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359060026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:45,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:45,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:05:45,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89205094] [2024-06-04 17:05:45,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:45,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:05:45,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:05:45,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:05:45,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:05:45,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 167 transitions, 1673 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:05:45,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:45,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:05:45,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:46,833 INFO L124 PetriNetUnfolderBase]: 2249/3484 cut-off events. [2024-06-04 17:05:46,833 INFO L125 PetriNetUnfolderBase]: For 105624/105632 co-relation queries the response was YES. [2024-06-04 17:05:46,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21361 conditions, 3484 events. 2249/3484 cut-off events. For 105624/105632 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18066 event pairs, 657 based on Foata normal form. 10/3492 useless extension candidates. Maximal degree in co-relation 21301. Up to 3218 conditions per place. [2024-06-04 17:05:46,857 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 144 selfloop transitions, 53 changer transitions 0/201 dead transitions. [2024-06-04 17:05:46,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 201 transitions, 2225 flow [2024-06-04 17:05:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-04 17:05:46,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4021164021164021 [2024-06-04 17:05:46,858 INFO L175 Difference]: Start difference. First operand has 128 places, 167 transitions, 1673 flow. Second operand 9 states and 152 transitions. [2024-06-04 17:05:46,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 201 transitions, 2225 flow [2024-06-04 17:05:46,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 201 transitions, 2132 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 17:05:46,942 INFO L231 Difference]: Finished difference. Result has 133 places, 171 transitions, 1751 flow [2024-06-04 17:05:46,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1751, PETRI_PLACES=133, PETRI_TRANSITIONS=171} [2024-06-04 17:05:46,943 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2024-06-04 17:05:46,943 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 171 transitions, 1751 flow [2024-06-04 17:05:46,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:05:46,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:46,943 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 17:05:46,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:05:46,944 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:05:46,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1057165177, now seen corresponding path program 3 times [2024-06-04 17:05:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414537805] [2024-06-04 17:05:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:56,931 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 17:05:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:56,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414537805] [2024-06-04 17:05:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414537805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:05:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912576548] [2024-06-04 17:05:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:56,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:05:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:05:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:05:57,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:05:57,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 171 transitions, 1751 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:05:57,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:57,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:05:57,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:58,437 INFO L124 PetriNetUnfolderBase]: 2368/3704 cut-off events. [2024-06-04 17:05:58,438 INFO L125 PetriNetUnfolderBase]: For 122757/122765 co-relation queries the response was YES. [2024-06-04 17:05:58,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23305 conditions, 3704 events. 2368/3704 cut-off events. For 122757/122765 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19758 event pairs, 457 based on Foata normal form. 24/3723 useless extension candidates. Maximal degree in co-relation 23243. Up to 2724 conditions per place. [2024-06-04 17:05:58,462 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 130 selfloop transitions, 82 changer transitions 0/216 dead transitions. [2024-06-04 17:05:58,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 216 transitions, 2490 flow [2024-06-04 17:05:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:05:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:05:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-04 17:05:58,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2024-06-04 17:05:58,465 INFO L175 Difference]: Start difference. First operand has 133 places, 171 transitions, 1751 flow. Second operand 8 states and 157 transitions. [2024-06-04 17:05:58,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 216 transitions, 2490 flow [2024-06-04 17:05:58,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 216 transitions, 2351 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-04 17:05:58,579 INFO L231 Difference]: Finished difference. Result has 134 places, 173 transitions, 1840 flow [2024-06-04 17:05:58,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1840, PETRI_PLACES=134, PETRI_TRANSITIONS=173} [2024-06-04 17:05:58,580 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places. [2024-06-04 17:05:58,580 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 173 transitions, 1840 flow [2024-06-04 17:05:58,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:05:58,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:58,580 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 17:05:58,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:05:58,581 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:05:58,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:58,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1057313047, now seen corresponding path program 4 times [2024-06-04 17:05:58,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125927497] [2024-06-04 17:05:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:07,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125927497] [2024-06-04 17:06:07,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125927497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:07,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:07,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:06:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553740301] [2024-06-04 17:06:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:06:07,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:07,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:06:07,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:06:07,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:06:07,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 173 transitions, 1840 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:06:07,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:07,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:06:07,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:08,912 INFO L124 PetriNetUnfolderBase]: 2443/3829 cut-off events. [2024-06-04 17:06:08,913 INFO L125 PetriNetUnfolderBase]: For 134467/134475 co-relation queries the response was YES. [2024-06-04 17:06:08,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24406 conditions, 3829 events. 2443/3829 cut-off events. For 134467/134475 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20715 event pairs, 602 based on Foata normal form. 28/3852 useless extension candidates. Maximal degree in co-relation 24343. Up to 3106 conditions per place. [2024-06-04 17:06:08,940 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 128 selfloop transitions, 81 changer transitions 0/213 dead transitions. [2024-06-04 17:06:08,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 213 transitions, 2431 flow [2024-06-04 17:06:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:06:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:06:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-04 17:06:08,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-04 17:06:08,943 INFO L175 Difference]: Start difference. First operand has 134 places, 173 transitions, 1840 flow. Second operand 8 states and 152 transitions. [2024-06-04 17:06:08,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 213 transitions, 2431 flow [2024-06-04 17:06:09,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 213 transitions, 2313 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 17:06:09,051 INFO L231 Difference]: Finished difference. Result has 138 places, 174 transitions, 1925 flow [2024-06-04 17:06:09,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1925, PETRI_PLACES=138, PETRI_TRANSITIONS=174} [2024-06-04 17:06:09,051 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2024-06-04 17:06:09,051 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 174 transitions, 1925 flow [2024-06-04 17:06:09,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:06:09,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:09,052 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 17:06:09,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:06:09,052 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 17:06:09,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1217489093, now seen corresponding path program 5 times [2024-06-04 17:06:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756972048] [2024-06-04 17:06:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:17,672 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 17:06:17,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:17,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756972048] [2024-06-04 17:06:17,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756972048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:17,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:17,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:06:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651808708] [2024-06-04 17:06:17,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:17,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:06:17,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:17,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:06:17,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:06:17,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:06:17,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 174 transitions, 1925 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:06:17,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:17,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:06:17,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:19,219 INFO L124 PetriNetUnfolderBase]: 2518/3941 cut-off events. [2024-06-04 17:06:19,220 INFO L125 PetriNetUnfolderBase]: For 142612/142614 co-relation queries the response was YES. [2024-06-04 17:06:19,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25410 conditions, 3941 events. 2518/3941 cut-off events. For 142612/142614 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21495 event pairs, 610 based on Foata normal form. 20/3956 useless extension candidates. Maximal degree in co-relation 25345. Up to 3231 conditions per place. [2024-06-04 17:06:19,246 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 128 selfloop transitions, 78 changer transitions 0/210 dead transitions. [2024-06-04 17:06:19,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 210 transitions, 2483 flow [2024-06-04 17:06:19,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:06:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:06:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-04 17:06:19,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-04 17:06:19,251 INFO L175 Difference]: Start difference. First operand has 138 places, 174 transitions, 1925 flow. Second operand 8 states and 148 transitions. [2024-06-04 17:06:19,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 210 transitions, 2483 flow [2024-06-04 17:06:19,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 210 transitions, 2310 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:06:19,369 INFO L231 Difference]: Finished difference. Result has 140 places, 175 transitions, 1949 flow [2024-06-04 17:06:19,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1752, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1949, PETRI_PLACES=140, PETRI_TRANSITIONS=175} [2024-06-04 17:06:19,369 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-06-04 17:06:19,370 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 175 transitions, 1949 flow [2024-06-04 17:06:19,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:06:19,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:19,370 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 17:06:19,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:06:19,370 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 17:06:19,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:19,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1062890629, now seen corresponding path program 1 times [2024-06-04 17:06:19,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:19,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992220865] [2024-06-04 17:06:19,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:19,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:27,455 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 17:06:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992220865] [2024-06-04 17:06:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992220865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:06:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212429588] [2024-06-04 17:06:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:27,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:06:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:06:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:06:27,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:06:27,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 175 transitions, 1949 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:06:27,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:27,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:06:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:28,895 INFO L124 PetriNetUnfolderBase]: 2559/4022 cut-off events. [2024-06-04 17:06:28,896 INFO L125 PetriNetUnfolderBase]: For 147280/147282 co-relation queries the response was YES. [2024-06-04 17:06:28,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25888 conditions, 4022 events. 2559/4022 cut-off events. For 147280/147282 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22194 event pairs, 570 based on Foata normal form. 12/4029 useless extension candidates. Maximal degree in co-relation 25822. Up to 2897 conditions per place. [2024-06-04 17:06:28,930 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 127 selfloop transitions, 81 changer transitions 0/212 dead transitions. [2024-06-04 17:06:28,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 212 transitions, 2513 flow [2024-06-04 17:06:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:06:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:06:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-04 17:06:28,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-04 17:06:28,932 INFO L175 Difference]: Start difference. First operand has 140 places, 175 transitions, 1949 flow. Second operand 8 states and 149 transitions. [2024-06-04 17:06:28,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 212 transitions, 2513 flow [2024-06-04 17:06:29,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 212 transitions, 2344 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:06:29,079 INFO L231 Difference]: Finished difference. Result has 142 places, 176 transitions, 1981 flow [2024-06-04 17:06:29,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1981, PETRI_PLACES=142, PETRI_TRANSITIONS=176} [2024-06-04 17:06:29,080 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places. [2024-06-04 17:06:29,080 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 176 transitions, 1981 flow [2024-06-04 17:06:29,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:06:29,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:29,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 17:06:29,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:06:29,080 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:06:29,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1820079237, now seen corresponding path program 1 times [2024-06-04 17:06:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418620796] [2024-06-04 17:06:29,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:38,326 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 17:06:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418620796] [2024-06-04 17:06:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418620796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:38,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:38,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:06:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739191274] [2024-06-04 17:06:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:38,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:06:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:06:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:06:38,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:06:38,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 176 transitions, 1981 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:06:38,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:38,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:06:38,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:39,939 INFO L124 PetriNetUnfolderBase]: 2564/4032 cut-off events. [2024-06-04 17:06:39,939 INFO L125 PetriNetUnfolderBase]: For 147668/147676 co-relation queries the response was YES. [2024-06-04 17:06:39,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26075 conditions, 4032 events. 2564/4032 cut-off events. For 147668/147676 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22286 event pairs, 767 based on Foata normal form. 9/4039 useless extension candidates. Maximal degree in co-relation 26008. Up to 3886 conditions per place. [2024-06-04 17:06:39,974 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 172 selfloop transitions, 19 changer transitions 0/195 dead transitions. [2024-06-04 17:06:39,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 195 transitions, 2462 flow [2024-06-04 17:06:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:06:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:06:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-04 17:06:39,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3843537414965986 [2024-06-04 17:06:39,976 INFO L175 Difference]: Start difference. First operand has 142 places, 176 transitions, 1981 flow. Second operand 7 states and 113 transitions. [2024-06-04 17:06:39,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 195 transitions, 2462 flow [2024-06-04 17:06:40,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 195 transitions, 2281 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 17:06:40,142 INFO L231 Difference]: Finished difference. Result has 143 places, 179 transitions, 1888 flow [2024-06-04 17:06:40,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1888, PETRI_PLACES=143, PETRI_TRANSITIONS=179} [2024-06-04 17:06:40,143 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2024-06-04 17:06:40,143 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 179 transitions, 1888 flow [2024-06-04 17:06:40,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:06:40,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:40,144 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 17:06:40,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:06:40,144 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:06:40,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1242497133, now seen corresponding path program 2 times [2024-06-04 17:06:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:40,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859726006] [2024-06-04 17:06:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:48,528 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 17:06:48,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859726006] [2024-06-04 17:06:48,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859726006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:48,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:48,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:06:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554810731] [2024-06-04 17:06:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:48,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:06:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:48,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:06:48,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:06:48,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:06:48,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 179 transitions, 1888 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 17:06:48,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:48,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:06:48,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:49,879 INFO L124 PetriNetUnfolderBase]: 2592/4074 cut-off events. [2024-06-04 17:06:49,879 INFO L125 PetriNetUnfolderBase]: For 152988/152993 co-relation queries the response was YES. [2024-06-04 17:06:49,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26354 conditions, 4074 events. 2592/4074 cut-off events. For 152988/152993 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 22524 event pairs, 775 based on Foata normal form. 4/4075 useless extension candidates. Maximal degree in co-relation 26286. Up to 3742 conditions per place. [2024-06-04 17:06:49,912 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 148 selfloop transitions, 50 changer transitions 0/202 dead transitions. [2024-06-04 17:06:49,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 202 transitions, 2510 flow [2024-06-04 17:06:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:06:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:06:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-04 17:06:49,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2024-06-04 17:06:49,935 INFO L175 Difference]: Start difference. First operand has 143 places, 179 transitions, 1888 flow. Second operand 7 states and 120 transitions. [2024-06-04 17:06:49,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 202 transitions, 2510 flow [2024-06-04 17:06:50,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 202 transitions, 2444 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-04 17:06:50,062 INFO L231 Difference]: Finished difference. Result has 146 places, 187 transitions, 2074 flow [2024-06-04 17:06:50,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2074, PETRI_PLACES=146, PETRI_TRANSITIONS=187} [2024-06-04 17:06:50,062 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places. [2024-06-04 17:06:50,063 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 187 transitions, 2074 flow [2024-06-04 17:06:50,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 17:06:50,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:50,063 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 17:06:50,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:06:50,063 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 17:06:50,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:50,064 INFO L85 PathProgramCache]: Analyzing trace with hash 368466087, now seen corresponding path program 6 times [2024-06-04 17:06:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:50,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692264864] [2024-06-04 17:06:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:58,694 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 17:06:58,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:58,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692264864] [2024-06-04 17:06:58,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692264864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:58,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:58,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:06:58,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690308522] [2024-06-04 17:06:58,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:58,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:06:58,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:06:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:06:58,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:06:58,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 187 transitions, 2074 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:06:58,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:58,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:06:58,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:00,281 INFO L124 PetriNetUnfolderBase]: 2556/4025 cut-off events. [2024-06-04 17:07:00,281 INFO L125 PetriNetUnfolderBase]: For 162288/162297 co-relation queries the response was YES. [2024-06-04 17:07:00,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26327 conditions, 4025 events. 2556/4025 cut-off events. For 162288/162297 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22146 event pairs, 625 based on Foata normal form. 23/4032 useless extension candidates. Maximal degree in co-relation 26257. Up to 3298 conditions per place. [2024-06-04 17:07:00,314 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 139 selfloop transitions, 74 changer transitions 0/217 dead transitions. [2024-06-04 17:07:00,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 217 transitions, 2602 flow [2024-06-04 17:07:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:07:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:07:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 17:07:00,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-04 17:07:00,317 INFO L175 Difference]: Start difference. First operand has 146 places, 187 transitions, 2074 flow. Second operand 8 states and 143 transitions. [2024-06-04 17:07:00,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 217 transitions, 2602 flow [2024-06-04 17:07:00,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 217 transitions, 2489 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-06-04 17:07:00,464 INFO L231 Difference]: Finished difference. Result has 151 places, 187 transitions, 2118 flow [2024-06-04 17:07:00,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2118, PETRI_PLACES=151, PETRI_TRANSITIONS=187} [2024-06-04 17:07:00,464 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places. [2024-06-04 17:07:00,464 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 187 transitions, 2118 flow [2024-06-04 17:07:00,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:07:00,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:00,465 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 17:07:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:07:00,465 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 17:07:00,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash 625181799, now seen corresponding path program 2 times [2024-06-04 17:07:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580695598] [2024-06-04 17:07:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:08,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:08,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580695598] [2024-06-04 17:07:08,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580695598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:08,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:08,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:07:08,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113478359] [2024-06-04 17:07:08,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:08,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:07:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:08,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:07:08,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:07:08,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:07:08,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 187 transitions, 2118 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:07:08,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:08,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:07:08,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:09,809 INFO L124 PetriNetUnfolderBase]: 2536/3989 cut-off events. [2024-06-04 17:07:09,809 INFO L125 PetriNetUnfolderBase]: For 157695/157704 co-relation queries the response was YES. [2024-06-04 17:07:09,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26154 conditions, 3989 events. 2536/3989 cut-off events. For 157695/157704 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21931 event pairs, 602 based on Foata normal form. 15/3988 useless extension candidates. Maximal degree in co-relation 26082. Up to 3176 conditions per place. [2024-06-04 17:07:09,838 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 139 selfloop transitions, 76 changer transitions 0/219 dead transitions. [2024-06-04 17:07:09,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 219 transitions, 2658 flow [2024-06-04 17:07:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:07:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:07:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-04 17:07:09,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-04 17:07:09,841 INFO L175 Difference]: Start difference. First operand has 151 places, 187 transitions, 2118 flow. Second operand 8 states and 145 transitions. [2024-06-04 17:07:09,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 219 transitions, 2658 flow [2024-06-04 17:07:09,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 219 transitions, 2479 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:07:09,985 INFO L231 Difference]: Finished difference. Result has 152 places, 187 transitions, 2097 flow [2024-06-04 17:07:09,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2097, PETRI_PLACES=152, PETRI_TRANSITIONS=187} [2024-06-04 17:07:09,986 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2024-06-04 17:07:09,986 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 187 transitions, 2097 flow [2024-06-04 17:07:09,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:07:09,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:09,986 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 17:07:09,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:07:09,986 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:07:09,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash 634378569, now seen corresponding path program 3 times [2024-06-04 17:07:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:09,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125152657] [2024-06-04 17:07:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:18,812 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 17:07:18,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:18,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125152657] [2024-06-04 17:07:18,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125152657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:18,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:18,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:07:18,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100838426] [2024-06-04 17:07:18,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:18,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:07:18,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:18,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:07:18,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:07:18,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:07:18,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 187 transitions, 2097 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:07:18,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:18,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:07:18,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:20,304 INFO L124 PetriNetUnfolderBase]: 2516/3957 cut-off events. [2024-06-04 17:07:20,305 INFO L125 PetriNetUnfolderBase]: For 157129/157138 co-relation queries the response was YES. [2024-06-04 17:07:20,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25588 conditions, 3957 events. 2516/3957 cut-off events. For 157129/157138 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21669 event pairs, 465 based on Foata normal form. 15/3956 useless extension candidates. Maximal degree in co-relation 25515. Up to 2494 conditions per place. [2024-06-04 17:07:20,333 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 130 selfloop transitions, 84 changer transitions 0/218 dead transitions. [2024-06-04 17:07:20,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 218 transitions, 2569 flow [2024-06-04 17:07:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:07:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:07:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-04 17:07:20,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-04 17:07:20,335 INFO L175 Difference]: Start difference. First operand has 152 places, 187 transitions, 2097 flow. Second operand 8 states and 143 transitions. [2024-06-04 17:07:20,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 218 transitions, 2569 flow [2024-06-04 17:07:20,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 218 transitions, 2306 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:07:20,468 INFO L231 Difference]: Finished difference. Result has 151 places, 186 transitions, 1944 flow [2024-06-04 17:07:20,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1772, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1944, PETRI_PLACES=151, PETRI_TRANSITIONS=186} [2024-06-04 17:07:20,469 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places. [2024-06-04 17:07:20,469 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 186 transitions, 1944 flow [2024-06-04 17:07:20,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:07:20,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:20,469 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 17:07:20,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:07:20,470 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 17:07:20,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:20,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1832459397, now seen corresponding path program 2 times [2024-06-04 17:07:20,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:20,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954672981] [2024-06-04 17:07:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954672981] [2024-06-04 17:07:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954672981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:30,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:30,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:07:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108500703] [2024-06-04 17:07:30,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:30,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:07:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:07:30,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:07:30,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:07:30,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 186 transitions, 1944 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:07:30,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:30,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:07:30,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:31,947 INFO L124 PetriNetUnfolderBase]: 2521/3968 cut-off events. [2024-06-04 17:07:31,948 INFO L125 PetriNetUnfolderBase]: For 156033/156050 co-relation queries the response was YES. [2024-06-04 17:07:31,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25348 conditions, 3968 events. 2521/3968 cut-off events. For 156033/156050 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21813 event pairs, 713 based on Foata normal form. 15/3978 useless extension candidates. Maximal degree in co-relation 25275. Up to 3796 conditions per place. [2024-06-04 17:07:31,976 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 172 selfloop transitions, 30 changer transitions 0/206 dead transitions. [2024-06-04 17:07:31,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 206 transitions, 2579 flow [2024-06-04 17:07:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:07:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:07:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-06-04 17:07:31,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2024-06-04 17:07:31,978 INFO L175 Difference]: Start difference. First operand has 151 places, 186 transitions, 1944 flow. Second operand 7 states and 110 transitions. [2024-06-04 17:07:31,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 206 transitions, 2579 flow [2024-06-04 17:07:32,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 206 transitions, 2345 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:07:32,121 INFO L231 Difference]: Finished difference. Result has 152 places, 194 transitions, 1901 flow [2024-06-04 17:07:32,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1901, PETRI_PLACES=152, PETRI_TRANSITIONS=194} [2024-06-04 17:07:32,122 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2024-06-04 17:07:32,122 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 194 transitions, 1901 flow [2024-06-04 17:07:32,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:07:32,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:32,123 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 17:07:32,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:07:32,123 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 17:07:32,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1832043315, now seen corresponding path program 3 times [2024-06-04 17:07:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:32,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437350100] [2024-06-04 17:07:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:40,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:40,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437350100] [2024-06-04 17:07:40,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437350100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:40,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:40,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:07:40,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18898125] [2024-06-04 17:07:40,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:40,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:07:40,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:40,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:07:40,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:07:41,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:07:41,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 194 transitions, 1901 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 17:07:41,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:41,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:07:41,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:42,188 INFO L124 PetriNetUnfolderBase]: 2525/3971 cut-off events. [2024-06-04 17:07:42,188 INFO L125 PetriNetUnfolderBase]: For 162028/162037 co-relation queries the response was YES. [2024-06-04 17:07:42,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24951 conditions, 3971 events. 2525/3971 cut-off events. For 162028/162037 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21792 event pairs, 746 based on Foata normal form. 5/3960 useless extension candidates. Maximal degree in co-relation 24877. Up to 3604 conditions per place. [2024-06-04 17:07:42,218 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 147 selfloop transitions, 62 changer transitions 0/213 dead transitions. [2024-06-04 17:07:42,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 213 transitions, 2643 flow [2024-06-04 17:07:42,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:07:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:07:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-04 17:07:42,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2024-06-04 17:07:42,221 INFO L175 Difference]: Start difference. First operand has 152 places, 194 transitions, 1901 flow. Second operand 7 states and 117 transitions. [2024-06-04 17:07:42,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 213 transitions, 2643 flow [2024-06-04 17:07:42,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 213 transitions, 2573 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-04 17:07:42,388 INFO L231 Difference]: Finished difference. Result has 157 places, 202 transitions, 2115 flow [2024-06-04 17:07:42,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2115, PETRI_PLACES=157, PETRI_TRANSITIONS=202} [2024-06-04 17:07:42,390 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places. [2024-06-04 17:07:42,390 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 202 transitions, 2115 flow [2024-06-04 17:07:42,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 17:07:42,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:42,390 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 17:07:42,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:07:42,391 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 17:07:42,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1832043687, now seen corresponding path program 3 times [2024-06-04 17:07:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:42,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887444335] [2024-06-04 17:07:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:52,385 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 17:07:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887444335] [2024-06-04 17:07:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887444335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:52,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:52,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:07:52,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507574397] [2024-06-04 17:07:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:52,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:07:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:52,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:07:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:07:52,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:07:52,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 202 transitions, 2115 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:07:52,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:52,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:07:52,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:53,647 INFO L124 PetriNetUnfolderBase]: 2522/3971 cut-off events. [2024-06-04 17:07:53,647 INFO L125 PetriNetUnfolderBase]: For 170837/170854 co-relation queries the response was YES. [2024-06-04 17:07:53,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25775 conditions, 3971 events. 2522/3971 cut-off events. For 170837/170854 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21798 event pairs, 712 based on Foata normal form. 15/3981 useless extension candidates. Maximal degree in co-relation 25698. Up to 3808 conditions per place. [2024-06-04 17:07:53,679 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 187 selfloop transitions, 23 changer transitions 0/214 dead transitions. [2024-06-04 17:07:53,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 214 transitions, 2587 flow [2024-06-04 17:07:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:07:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:07:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-04 17:07:53,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3673469387755102 [2024-06-04 17:07:53,680 INFO L175 Difference]: Start difference. First operand has 157 places, 202 transitions, 2115 flow. Second operand 7 states and 108 transitions. [2024-06-04 17:07:53,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 214 transitions, 2587 flow [2024-06-04 17:07:53,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 214 transitions, 2375 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-04 17:07:53,861 INFO L231 Difference]: Finished difference. Result has 160 places, 203 transitions, 1964 flow [2024-06-04 17:07:53,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1964, PETRI_PLACES=160, PETRI_TRANSITIONS=203} [2024-06-04 17:07:53,861 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-06-04 17:07:53,861 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 203 transitions, 1964 flow [2024-06-04 17:07:53,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:07:53,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:53,862 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 17:07:53,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:07:53,862 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 17:07:53,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1359465561, now seen corresponding path program 1 times [2024-06-04 17:07:53,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:53,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349485176] [2024-06-04 17:07:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349485176] [2024-06-04 17:08:02,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349485176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:02,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:02,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:08:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724187480] [2024-06-04 17:08:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:02,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:08:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:08:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:08:02,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:08:02,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 203 transitions, 1964 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:08:02,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:02,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:08:02,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:03,969 INFO L124 PetriNetUnfolderBase]: 2428/3865 cut-off events. [2024-06-04 17:08:03,970 INFO L125 PetriNetUnfolderBase]: For 177801/177803 co-relation queries the response was YES. [2024-06-04 17:08:03,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24900 conditions, 3865 events. 2428/3865 cut-off events. For 177801/177803 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21436 event pairs, 712 based on Foata normal form. 2/3865 useless extension candidates. Maximal degree in co-relation 24822. Up to 3631 conditions per place. [2024-06-04 17:08:03,999 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 198 selfloop transitions, 18 changer transitions 0/225 dead transitions. [2024-06-04 17:08:04,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 225 transitions, 2498 flow [2024-06-04 17:08:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:08:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:08:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-04 17:08:04,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2024-06-04 17:08:04,002 INFO L175 Difference]: Start difference. First operand has 160 places, 203 transitions, 1964 flow. Second operand 7 states and 120 transitions. [2024-06-04 17:08:04,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 225 transitions, 2498 flow [2024-06-04 17:08:04,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 225 transitions, 2448 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:08:04,175 INFO L231 Difference]: Finished difference. Result has 163 places, 209 transitions, 2024 flow [2024-06-04 17:08:04,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2024, PETRI_PLACES=163, PETRI_TRANSITIONS=209} [2024-06-04 17:08:04,176 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2024-06-04 17:08:04,176 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 209 transitions, 2024 flow [2024-06-04 17:08:04,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:08:04,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:04,176 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 17:08:04,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:08:04,177 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 17:08:04,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1359345405, now seen corresponding path program 1 times [2024-06-04 17:08:04,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:04,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522932895] [2024-06-04 17:08:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:13,584 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 17:08:13,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:13,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522932895] [2024-06-04 17:08:13,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522932895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:13,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:13,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:08:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081528601] [2024-06-04 17:08:13,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:13,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:08:13,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:13,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:08:13,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:08:13,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:08:13,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 209 transitions, 2024 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:08:13,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:13,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:08:13,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:14,936 INFO L124 PetriNetUnfolderBase]: 2438/3879 cut-off events. [2024-06-04 17:08:14,937 INFO L125 PetriNetUnfolderBase]: For 185736/185738 co-relation queries the response was YES. [2024-06-04 17:08:14,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25713 conditions, 3879 events. 2438/3879 cut-off events. For 185736/185738 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21499 event pairs, 689 based on Foata normal form. 2/3879 useless extension candidates. Maximal degree in co-relation 25633. Up to 3661 conditions per place. [2024-06-04 17:08:14,967 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 200 selfloop transitions, 15 changer transitions 0/224 dead transitions. [2024-06-04 17:08:14,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 224 transitions, 2528 flow [2024-06-04 17:08:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:08:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:08:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-04 17:08:14,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391156462585034 [2024-06-04 17:08:14,969 INFO L175 Difference]: Start difference. First operand has 163 places, 209 transitions, 2024 flow. Second operand 7 states and 115 transitions. [2024-06-04 17:08:14,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 224 transitions, 2528 flow [2024-06-04 17:08:15,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 224 transitions, 2474 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-04 17:08:15,153 INFO L231 Difference]: Finished difference. Result has 167 places, 212 transitions, 2052 flow [2024-06-04 17:08:15,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2052, PETRI_PLACES=167, PETRI_TRANSITIONS=212} [2024-06-04 17:08:15,154 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places. [2024-06-04 17:08:15,154 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 212 transitions, 2052 flow [2024-06-04 17:08:15,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:08:15,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:15,154 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 17:08:15,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:08:15,154 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 17:08:15,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:15,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1359345591, now seen corresponding path program 2 times [2024-06-04 17:08:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792764556] [2024-06-04 17:08:15,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:23,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792764556] [2024-06-04 17:08:23,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792764556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:23,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:23,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:08:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968254622] [2024-06-04 17:08:23,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:23,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:08:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:23,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:08:23,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:08:23,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:08:23,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 212 transitions, 2052 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:08:23,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:23,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:08:23,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:24,982 INFO L124 PetriNetUnfolderBase]: 2456/3904 cut-off events. [2024-06-04 17:08:24,982 INFO L125 PetriNetUnfolderBase]: For 194630/194632 co-relation queries the response was YES. [2024-06-04 17:08:25,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26312 conditions, 3904 events. 2456/3904 cut-off events. For 194630/194632 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 21625 event pairs, 689 based on Foata normal form. 2/3904 useless extension candidates. Maximal degree in co-relation 26231. Up to 3655 conditions per place. [2024-06-04 17:08:25,014 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 199 selfloop transitions, 25 changer transitions 0/233 dead transitions. [2024-06-04 17:08:25,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 233 transitions, 2730 flow [2024-06-04 17:08:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:08:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:08:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-04 17:08:25,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41156462585034015 [2024-06-04 17:08:25,016 INFO L175 Difference]: Start difference. First operand has 167 places, 212 transitions, 2052 flow. Second operand 7 states and 121 transitions. [2024-06-04 17:08:25,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 233 transitions, 2730 flow [2024-06-04 17:08:25,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 233 transitions, 2670 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 17:08:25,236 INFO L231 Difference]: Finished difference. Result has 169 places, 218 transitions, 2150 flow [2024-06-04 17:08:25,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2150, PETRI_PLACES=169, PETRI_TRANSITIONS=218} [2024-06-04 17:08:25,237 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places. [2024-06-04 17:08:25,237 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 218 transitions, 2150 flow [2024-06-04 17:08:25,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:08:25,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:25,237 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 17:08:25,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:08:25,237 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 17:08:25,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1354697265, now seen corresponding path program 2 times [2024-06-04 17:08:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958449193] [2024-06-04 17:08:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:34,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:34,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958449193] [2024-06-04 17:08:34,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958449193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:34,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:34,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:08:34,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232396589] [2024-06-04 17:08:34,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:34,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:08:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:08:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:08:34,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:08:34,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 218 transitions, 2150 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:08:34,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:34,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:08:34,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:35,757 INFO L124 PetriNetUnfolderBase]: 2468/3923 cut-off events. [2024-06-04 17:08:35,757 INFO L125 PetriNetUnfolderBase]: For 206383/206385 co-relation queries the response was YES. [2024-06-04 17:08:35,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26953 conditions, 3923 events. 2468/3923 cut-off events. For 206383/206385 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21776 event pairs, 687 based on Foata normal form. 3/3924 useless extension candidates. Maximal degree in co-relation 26871. Up to 3666 conditions per place. [2024-06-04 17:08:35,796 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 202 selfloop transitions, 30 changer transitions 0/241 dead transitions. [2024-06-04 17:08:35,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 241 transitions, 2872 flow [2024-06-04 17:08:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:08:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:08:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 17:08:35,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 17:08:35,798 INFO L175 Difference]: Start difference. First operand has 169 places, 218 transitions, 2150 flow. Second operand 8 states and 133 transitions. [2024-06-04 17:08:35,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 241 transitions, 2872 flow [2024-06-04 17:08:36,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 241 transitions, 2798 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-04 17:08:36,027 INFO L231 Difference]: Finished difference. Result has 174 places, 225 transitions, 2281 flow [2024-06-04 17:08:36,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2281, PETRI_PLACES=174, PETRI_TRANSITIONS=225} [2024-06-04 17:08:36,028 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places. [2024-06-04 17:08:36,028 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 225 transitions, 2281 flow [2024-06-04 17:08:36,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:08:36,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:36,028 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 17:08:36,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:08:36,029 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 17:08:36,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1832228199, now seen corresponding path program 3 times [2024-06-04 17:08:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409103769] [2024-06-04 17:08:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409103769] [2024-06-04 17:08:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409103769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:45,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:45,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:08:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109218435] [2024-06-04 17:08:45,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:45,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:08:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:45,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:08:45,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:08:45,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:08:45,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 225 transitions, 2281 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:08:45,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:45,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:08:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:46,771 INFO L124 PetriNetUnfolderBase]: 2467/3922 cut-off events. [2024-06-04 17:08:46,772 INFO L125 PetriNetUnfolderBase]: For 213136/213138 co-relation queries the response was YES. [2024-06-04 17:08:46,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27278 conditions, 3922 events. 2467/3922 cut-off events. For 213136/213138 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 21788 event pairs, 690 based on Foata normal form. 3/3923 useless extension candidates. Maximal degree in co-relation 27194. Up to 3694 conditions per place. [2024-06-04 17:08:46,808 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 212 selfloop transitions, 21 changer transitions 0/242 dead transitions. [2024-06-04 17:08:46,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 242 transitions, 2840 flow [2024-06-04 17:08:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:08:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:08:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-04 17:08:46,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3869047619047619 [2024-06-04 17:08:46,809 INFO L175 Difference]: Start difference. First operand has 174 places, 225 transitions, 2281 flow. Second operand 8 states and 130 transitions. [2024-06-04 17:08:46,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 242 transitions, 2840 flow [2024-06-04 17:08:47,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 242 transitions, 2773 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-04 17:08:47,049 INFO L231 Difference]: Finished difference. Result has 178 places, 228 transitions, 2319 flow [2024-06-04 17:08:47,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2319, PETRI_PLACES=178, PETRI_TRANSITIONS=228} [2024-06-04 17:08:47,050 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places. [2024-06-04 17:08:47,050 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 228 transitions, 2319 flow [2024-06-04 17:08:47,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:08:47,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:47,050 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 17:08:47,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:08:47,051 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 17:08:47,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1832228013, now seen corresponding path program 3 times [2024-06-04 17:08:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913223325] [2024-06-04 17:08:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:55,406 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 17:08:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913223325] [2024-06-04 17:08:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913223325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:55,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:55,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:08:55,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872603446] [2024-06-04 17:08:55,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:55,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:08:55,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:55,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:08:55,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:08:55,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:08:55,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 228 transitions, 2319 flow. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:08:55,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:55,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:08:55,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:56,689 INFO L124 PetriNetUnfolderBase]: 2434/3889 cut-off events. [2024-06-04 17:08:56,689 INFO L125 PetriNetUnfolderBase]: For 218737/218742 co-relation queries the response was YES. [2024-06-04 17:08:56,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27104 conditions, 3889 events. 2434/3889 cut-off events. For 218737/218742 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21770 event pairs, 683 based on Foata normal form. 2/3887 useless extension candidates. Maximal degree in co-relation 27018. Up to 3625 conditions per place. [2024-06-04 17:08:56,721 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 202 selfloop transitions, 32 changer transitions 0/243 dead transitions. [2024-06-04 17:08:56,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 243 transitions, 2971 flow [2024-06-04 17:08:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:08:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:08:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-04 17:08:56,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2024-06-04 17:08:56,724 INFO L175 Difference]: Start difference. First operand has 178 places, 228 transitions, 2319 flow. Second operand 7 states and 120 transitions. [2024-06-04 17:08:56,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 243 transitions, 2971 flow [2024-06-04 17:08:56,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 243 transitions, 2911 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 17:08:56,936 INFO L231 Difference]: Finished difference. Result has 179 places, 231 transitions, 2389 flow [2024-06-04 17:08:56,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2389, PETRI_PLACES=179, PETRI_TRANSITIONS=231} [2024-06-04 17:08:56,937 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 136 predicate places. [2024-06-04 17:08:56,937 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 231 transitions, 2389 flow [2024-06-04 17:08:56,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:08:56,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:56,938 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 17:08:56,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:08:56,938 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 17:08:56,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1832474277, now seen corresponding path program 1 times [2024-06-04 17:08:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:56,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092392642] [2024-06-04 17:08:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:07,303 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 17:09:07,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:07,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092392642] [2024-06-04 17:09:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092392642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:07,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:07,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:09:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308383608] [2024-06-04 17:09:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:07,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:09:07,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:09:07,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:09:07,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:09:07,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 231 transitions, 2389 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:09:07,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:07,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:09:07,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:08,756 INFO L124 PetriNetUnfolderBase]: 2565/4016 cut-off events. [2024-06-04 17:09:08,757 INFO L125 PetriNetUnfolderBase]: For 223174/223176 co-relation queries the response was YES. [2024-06-04 17:09:08,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28209 conditions, 4016 events. 2565/4016 cut-off events. For 223174/223176 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21979 event pairs, 722 based on Foata normal form. 1/4015 useless extension candidates. Maximal degree in co-relation 28122. Up to 3895 conditions per place. [2024-06-04 17:09:08,795 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 221 selfloop transitions, 18 changer transitions 0/243 dead transitions. [2024-06-04 17:09:08,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 243 transitions, 2925 flow [2024-06-04 17:09:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:09:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:09:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-04 17:09:08,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2024-06-04 17:09:08,797 INFO L175 Difference]: Start difference. First operand has 179 places, 231 transitions, 2389 flow. Second operand 8 states and 118 transitions. [2024-06-04 17:09:08,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 243 transitions, 2925 flow [2024-06-04 17:09:09,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 243 transitions, 2817 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-04 17:09:09,089 INFO L231 Difference]: Finished difference. Result has 182 places, 233 transitions, 2359 flow [2024-06-04 17:09:09,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2359, PETRI_PLACES=182, PETRI_TRANSITIONS=233} [2024-06-04 17:09:09,090 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places. [2024-06-04 17:09:09,090 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 233 transitions, 2359 flow [2024-06-04 17:09:09,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:09:09,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:09,091 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 17:09:09,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:09:09,091 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 17:09:09,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:09,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1442704703, now seen corresponding path program 1 times [2024-06-04 17:09:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:09,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376310452] [2024-06-04 17:09:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:18,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:18,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376310452] [2024-06-04 17:09:18,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376310452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:18,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:18,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:09:18,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144022080] [2024-06-04 17:09:18,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:18,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:09:18,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:18,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:09:18,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:09:18,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:09:18,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 233 transitions, 2359 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:09:18,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:18,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:09:18,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:20,202 INFO L124 PetriNetUnfolderBase]: 2575/4042 cut-off events. [2024-06-04 17:09:20,203 INFO L125 PetriNetUnfolderBase]: For 232447/232461 co-relation queries the response was YES. [2024-06-04 17:09:20,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28365 conditions, 4042 events. 2575/4042 cut-off events. For 232447/232461 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 22194 event pairs, 661 based on Foata normal form. 14/4053 useless extension candidates. Maximal degree in co-relation 28277. Up to 3744 conditions per place. [2024-06-04 17:09:20,237 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 202 selfloop transitions, 53 changer transitions 0/259 dead transitions. [2024-06-04 17:09:20,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 259 transitions, 3014 flow [2024-06-04 17:09:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:09:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:09:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-04 17:09:20,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-04 17:09:20,239 INFO L175 Difference]: Start difference. First operand has 182 places, 233 transitions, 2359 flow. Second operand 8 states and 136 transitions. [2024-06-04 17:09:20,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 259 transitions, 3014 flow [2024-06-04 17:09:20,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 259 transitions, 2904 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-04 17:09:20,540 INFO L231 Difference]: Finished difference. Result has 183 places, 237 transitions, 2436 flow [2024-06-04 17:09:20,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2436, PETRI_PLACES=183, PETRI_TRANSITIONS=237} [2024-06-04 17:09:20,541 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 140 predicate places. [2024-06-04 17:09:20,541 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 237 transitions, 2436 flow [2024-06-04 17:09:20,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:09:20,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:20,542 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 17:09:20,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:09:20,542 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 17:09:20,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash 599223376, now seen corresponding path program 1 times [2024-06-04 17:09:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:20,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687666280] [2024-06-04 17:09:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:29,017 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 17:09:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:29,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687666280] [2024-06-04 17:09:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687666280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:29,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:09:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529602164] [2024-06-04 17:09:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:29,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:09:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:09:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:09:29,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:09:29,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 237 transitions, 2436 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:09:29,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:29,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:09:29,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:30,474 INFO L124 PetriNetUnfolderBase]: 2585/4051 cut-off events. [2024-06-04 17:09:30,475 INFO L125 PetriNetUnfolderBase]: For 241711/241719 co-relation queries the response was YES. [2024-06-04 17:09:30,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29173 conditions, 4051 events. 2585/4051 cut-off events. For 241711/241719 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22159 event pairs, 657 based on Foata normal form. 10/4059 useless extension candidates. Maximal degree in co-relation 29085. Up to 3760 conditions per place. [2024-06-04 17:09:30,514 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 215 selfloop transitions, 52 changer transitions 0/271 dead transitions. [2024-06-04 17:09:30,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 271 transitions, 3137 flow [2024-06-04 17:09:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:09:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:09:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-04 17:09:30,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4021164021164021 [2024-06-04 17:09:30,516 INFO L175 Difference]: Start difference. First operand has 183 places, 237 transitions, 2436 flow. Second operand 9 states and 152 transitions. [2024-06-04 17:09:30,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 271 transitions, 3137 flow [2024-06-04 17:09:30,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 271 transitions, 2978 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-04 17:09:30,828 INFO L231 Difference]: Finished difference. Result has 186 places, 241 transitions, 2456 flow [2024-06-04 17:09:30,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2456, PETRI_PLACES=186, PETRI_TRANSITIONS=241} [2024-06-04 17:09:30,829 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places. [2024-06-04 17:09:30,829 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 241 transitions, 2456 flow [2024-06-04 17:09:30,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:09:30,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:30,834 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 17:09:30,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:09:30,835 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:09:30,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1271130760, now seen corresponding path program 2 times [2024-06-04 17:09:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:30,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348039789] [2024-06-04 17:09:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:39,916 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 17:09:39,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:39,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348039789] [2024-06-04 17:09:39,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348039789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:39,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:39,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:09:39,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555453513] [2024-06-04 17:09:39,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:39,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:09:39,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:39,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:09:39,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:09:40,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:09:40,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 241 transitions, 2456 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:09:40,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:40,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:09:40,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:41,368 INFO L124 PetriNetUnfolderBase]: 2587/4051 cut-off events. [2024-06-04 17:09:41,368 INFO L125 PetriNetUnfolderBase]: For 248979/248987 co-relation queries the response was YES. [2024-06-04 17:09:41,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29290 conditions, 4051 events. 2587/4051 cut-off events. For 248979/248987 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22127 event pairs, 652 based on Foata normal form. 10/4059 useless extension candidates. Maximal degree in co-relation 29201. Up to 3717 conditions per place. [2024-06-04 17:09:41,409 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 206 selfloop transitions, 61 changer transitions 0/271 dead transitions. [2024-06-04 17:09:41,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 271 transitions, 3243 flow [2024-06-04 17:09:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:09:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:09:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-04 17:09:41,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994708994708995 [2024-06-04 17:09:41,411 INFO L175 Difference]: Start difference. First operand has 186 places, 241 transitions, 2456 flow. Second operand 9 states and 151 transitions. [2024-06-04 17:09:41,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 271 transitions, 3243 flow [2024-06-04 17:09:41,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 271 transitions, 3111 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-04 17:09:41,686 INFO L231 Difference]: Finished difference. Result has 188 places, 244 transitions, 2513 flow [2024-06-04 17:09:41,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2513, PETRI_PLACES=188, PETRI_TRANSITIONS=244} [2024-06-04 17:09:41,686 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2024-06-04 17:09:41,686 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 244 transitions, 2513 flow [2024-06-04 17:09:41,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:09:41,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:41,687 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 17:09:41,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:09:41,687 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 17:09:41,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash -137293083, now seen corresponding path program 2 times [2024-06-04 17:09:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:41,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65640152] [2024-06-04 17:09:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:51,644 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 17:09:51,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:51,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65640152] [2024-06-04 17:09:51,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65640152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:51,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:51,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:09:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848354334] [2024-06-04 17:09:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:51,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:09:51,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:09:51,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:09:51,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:09:51,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 244 transitions, 2513 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:09:51,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:51,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:09:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:53,185 INFO L124 PetriNetUnfolderBase]: 2599/4067 cut-off events. [2024-06-04 17:09:53,185 INFO L125 PetriNetUnfolderBase]: For 259214/259222 co-relation queries the response was YES. [2024-06-04 17:09:53,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29587 conditions, 4067 events. 2599/4067 cut-off events. For 259214/259222 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22265 event pairs, 675 based on Foata normal form. 6/4070 useless extension candidates. Maximal degree in co-relation 29497. Up to 3727 conditions per place. [2024-06-04 17:09:53,219 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 199 selfloop transitions, 61 changer transitions 0/264 dead transitions. [2024-06-04 17:09:53,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 264 transitions, 3257 flow [2024-06-04 17:09:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:09:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:09:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-04 17:09:53,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-04 17:09:53,221 INFO L175 Difference]: Start difference. First operand has 188 places, 244 transitions, 2513 flow. Second operand 8 states and 132 transitions. [2024-06-04 17:09:53,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 264 transitions, 3257 flow [2024-06-04 17:09:53,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 264 transitions, 3126 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-04 17:09:53,567 INFO L231 Difference]: Finished difference. Result has 190 places, 248 transitions, 2593 flow [2024-06-04 17:09:53,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2382, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2593, PETRI_PLACES=190, PETRI_TRANSITIONS=248} [2024-06-04 17:09:53,568 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places. [2024-06-04 17:09:53,568 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 248 transitions, 2593 flow [2024-06-04 17:09:53,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:09:53,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:53,568 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 17:09:53,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:09:53,568 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 17:09:53,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:53,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1271123227, now seen corresponding path program 3 times [2024-06-04 17:09:53,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:53,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919026383] [2024-06-04 17:09:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:03,770 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 17:10:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919026383] [2024-06-04 17:10:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919026383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:03,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:03,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:10:03,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847566732] [2024-06-04 17:10:03,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:03,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:10:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:03,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:10:03,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:10:03,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:10:03,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 248 transitions, 2593 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:10:03,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:03,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:10:03,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:05,217 INFO L124 PetriNetUnfolderBase]: 2627/4113 cut-off events. [2024-06-04 17:10:05,218 INFO L125 PetriNetUnfolderBase]: For 272063/272071 co-relation queries the response was YES. [2024-06-04 17:10:05,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30583 conditions, 4113 events. 2627/4113 cut-off events. For 272063/272071 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22567 event pairs, 674 based on Foata normal form. 6/4116 useless extension candidates. Maximal degree in co-relation 30492. Up to 3727 conditions per place. [2024-06-04 17:10:05,259 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 201 selfloop transitions, 68 changer transitions 0/273 dead transitions. [2024-06-04 17:10:05,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 273 transitions, 3547 flow [2024-06-04 17:10:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:10:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:10:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 17:10:05,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2024-06-04 17:10:05,261 INFO L175 Difference]: Start difference. First operand has 190 places, 248 transitions, 2593 flow. Second operand 8 states and 134 transitions. [2024-06-04 17:10:05,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 273 transitions, 3547 flow [2024-06-04 17:10:05,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 273 transitions, 3364 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-04 17:10:05,583 INFO L231 Difference]: Finished difference. Result has 193 places, 256 transitions, 2737 flow [2024-06-04 17:10:05,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2737, PETRI_PLACES=193, PETRI_TRANSITIONS=256} [2024-06-04 17:10:05,583 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places. [2024-06-04 17:10:05,584 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 256 transitions, 2737 flow [2024-06-04 17:10:05,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:10:05,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:05,584 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 17:10:05,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:10:05,584 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 17:10:05,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:05,585 INFO L85 PathProgramCache]: Analyzing trace with hash -319157868, now seen corresponding path program 1 times [2024-06-04 17:10:05,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:05,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842953360] [2024-06-04 17:10:05,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:05,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:15,074 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 17:10:15,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842953360] [2024-06-04 17:10:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842953360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:15,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:10:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325140731] [2024-06-04 17:10:15,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:10:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:10:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:10:15,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:10:15,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 256 transitions, 2737 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:10:15,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:15,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:10:15,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:16,620 INFO L124 PetriNetUnfolderBase]: 2632/4124 cut-off events. [2024-06-04 17:10:16,620 INFO L125 PetriNetUnfolderBase]: For 280379/280387 co-relation queries the response was YES. [2024-06-04 17:10:16,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31335 conditions, 4124 events. 2632/4124 cut-off events. For 280379/280387 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 22582 event pairs, 666 based on Foata normal form. 9/4131 useless extension candidates. Maximal degree in co-relation 31242. Up to 3966 conditions per place. [2024-06-04 17:10:16,663 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 250 selfloop transitions, 22 changer transitions 0/276 dead transitions. [2024-06-04 17:10:16,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 276 transitions, 3412 flow [2024-06-04 17:10:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:10:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:10:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-04 17:10:16,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2024-06-04 17:10:16,682 INFO L175 Difference]: Start difference. First operand has 193 places, 256 transitions, 2737 flow. Second operand 8 states and 124 transitions. [2024-06-04 17:10:16,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 276 transitions, 3412 flow [2024-06-04 17:10:17,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 276 transitions, 3250 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-04 17:10:17,146 INFO L231 Difference]: Finished difference. Result has 197 places, 259 transitions, 2699 flow [2024-06-04 17:10:17,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2699, PETRI_PLACES=197, PETRI_TRANSITIONS=259} [2024-06-04 17:10:17,146 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places. [2024-06-04 17:10:17,147 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 259 transitions, 2699 flow [2024-06-04 17:10:17,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:10:17,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:17,147 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 17:10:17,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:10:17,147 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 17:10:17,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 798525166, now seen corresponding path program 3 times [2024-06-04 17:10:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:17,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356072982] [2024-06-04 17:10:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:26,502 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 17:10:26,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356072982] [2024-06-04 17:10:26,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356072982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:26,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:26,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:10:26,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293304518] [2024-06-04 17:10:26,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:26,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:10:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:10:26,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:10:26,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:10:26,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 259 transitions, 2699 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:10:26,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:26,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:10:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:27,910 INFO L124 PetriNetUnfolderBase]: 2625/4122 cut-off events. [2024-06-04 17:10:27,910 INFO L125 PetriNetUnfolderBase]: For 286935/286952 co-relation queries the response was YES. [2024-06-04 17:10:27,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31516 conditions, 4122 events. 2625/4122 cut-off events. For 286935/286952 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22627 event pairs, 659 based on Foata normal form. 15/4132 useless extension candidates. Maximal degree in co-relation 31421. Up to 3829 conditions per place. [2024-06-04 17:10:27,947 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 229 selfloop transitions, 50 changer transitions 0/283 dead transitions. [2024-06-04 17:10:27,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 283 transitions, 3354 flow [2024-06-04 17:10:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:10:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:10:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 17:10:27,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2024-06-04 17:10:27,950 INFO L175 Difference]: Start difference. First operand has 197 places, 259 transitions, 2699 flow. Second operand 8 states and 134 transitions. [2024-06-04 17:10:27,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 283 transitions, 3354 flow [2024-06-04 17:10:28,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 283 transitions, 3226 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-04 17:10:28,306 INFO L231 Difference]: Finished difference. Result has 199 places, 259 transitions, 2678 flow [2024-06-04 17:10:28,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2678, PETRI_PLACES=199, PETRI_TRANSITIONS=259} [2024-06-04 17:10:28,306 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places. [2024-06-04 17:10:28,307 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 259 transitions, 2678 flow [2024-06-04 17:10:28,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:10:28,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:28,307 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 17:10:28,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:10:28,307 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 17:10:28,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash 716424160, now seen corresponding path program 4 times [2024-06-04 17:10:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:28,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010024226] [2024-06-04 17:10:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:37,520 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 17:10:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010024226] [2024-06-04 17:10:37,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010024226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:37,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:37,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:10:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893309792] [2024-06-04 17:10:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:37,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:10:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:10:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:10:37,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:10:37,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 259 transitions, 2678 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:10:37,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:37,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:10:37,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:38,929 INFO L124 PetriNetUnfolderBase]: 2630/4129 cut-off events. [2024-06-04 17:10:38,929 INFO L125 PetriNetUnfolderBase]: For 296425/296442 co-relation queries the response was YES. [2024-06-04 17:10:38,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31830 conditions, 4129 events. 2630/4129 cut-off events. For 296425/296442 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22679 event pairs, 659 based on Foata normal form. 15/4139 useless extension candidates. Maximal degree in co-relation 31734. Up to 3812 conditions per place. [2024-06-04 17:10:38,969 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 220 selfloop transitions, 59 changer transitions 0/283 dead transitions. [2024-06-04 17:10:38,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 283 transitions, 3370 flow [2024-06-04 17:10:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:10:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:10:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 17:10:38,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 17:10:38,971 INFO L175 Difference]: Start difference. First operand has 199 places, 259 transitions, 2678 flow. Second operand 8 states and 133 transitions. [2024-06-04 17:10:38,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 283 transitions, 3370 flow [2024-06-04 17:10:39,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 283 transitions, 3202 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:10:39,334 INFO L231 Difference]: Finished difference. Result has 199 places, 262 transitions, 2692 flow [2024-06-04 17:10:39,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2692, PETRI_PLACES=199, PETRI_TRANSITIONS=262} [2024-06-04 17:10:39,335 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places. [2024-06-04 17:10:39,335 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 262 transitions, 2692 flow [2024-06-04 17:10:39,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:10:39,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:39,335 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 17:10:39,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:10:39,336 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:10:39,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:39,336 INFO L85 PathProgramCache]: Analyzing trace with hash 958773002, now seen corresponding path program 5 times [2024-06-04 17:10:39,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:39,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596312542] [2024-06-04 17:10:39,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:48,325 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 17:10:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596312542] [2024-06-04 17:10:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596312542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:48,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:10:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162628558] [2024-06-04 17:10:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:48,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:10:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:10:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:10:48,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:10:48,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 262 transitions, 2692 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 17:10:48,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:48,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:10:48,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:49,566 INFO L124 PetriNetUnfolderBase]: 2632/4120 cut-off events. [2024-06-04 17:10:49,567 INFO L125 PetriNetUnfolderBase]: For 306579/306591 co-relation queries the response was YES. [2024-06-04 17:10:49,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31921 conditions, 4120 events. 2632/4120 cut-off events. For 306579/306591 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22579 event pairs, 696 based on Foata normal form. 7/4111 useless extension candidates. Maximal degree in co-relation 31824. Up to 3746 conditions per place. [2024-06-04 17:10:49,608 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 200 selfloop transitions, 71 changer transitions 0/275 dead transitions. [2024-06-04 17:10:49,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 275 transitions, 3434 flow [2024-06-04 17:10:49,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:10:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:10:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 17:10:49,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-06-04 17:10:49,617 INFO L175 Difference]: Start difference. First operand has 199 places, 262 transitions, 2692 flow. Second operand 7 states and 116 transitions. [2024-06-04 17:10:49,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 275 transitions, 3434 flow [2024-06-04 17:10:49,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 275 transitions, 3284 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:10:49,994 INFO L231 Difference]: Finished difference. Result has 200 places, 265 transitions, 2752 flow [2024-06-04 17:10:49,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2542, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2752, PETRI_PLACES=200, PETRI_TRANSITIONS=265} [2024-06-04 17:10:49,996 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places. [2024-06-04 17:10:49,996 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 265 transitions, 2752 flow [2024-06-04 17:10:49,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 17:10:49,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:49,996 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 17:10:49,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:10:49,997 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:10:49,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash 178346964, now seen corresponding path program 6 times [2024-06-04 17:10:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:49,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248648174] [2024-06-04 17:10:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:49,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:58,564 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 17:10:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248648174] [2024-06-04 17:10:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248648174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:58,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:58,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:10:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460185924] [2024-06-04 17:10:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:58,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:10:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:58,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:10:58,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:10:58,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:10:58,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 265 transitions, 2752 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 17:10:58,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:58,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:10:58,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:59,846 INFO L124 PetriNetUnfolderBase]: 2627/4114 cut-off events. [2024-06-04 17:10:59,847 INFO L125 PetriNetUnfolderBase]: For 312814/312826 co-relation queries the response was YES. [2024-06-04 17:10:59,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31963 conditions, 4114 events. 2627/4114 cut-off events. For 312814/312826 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22513 event pairs, 697 based on Foata normal form. 6/4104 useless extension candidates. Maximal degree in co-relation 31865. Up to 3741 conditions per place. [2024-06-04 17:10:59,883 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 195 selfloop transitions, 75 changer transitions 0/274 dead transitions. [2024-06-04 17:10:59,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 274 transitions, 3316 flow [2024-06-04 17:10:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:10:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:10:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 17:10:59,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3877551020408163 [2024-06-04 17:10:59,884 INFO L175 Difference]: Start difference. First operand has 200 places, 265 transitions, 2752 flow. Second operand 7 states and 114 transitions. [2024-06-04 17:10:59,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 274 transitions, 3316 flow [2024-06-04 17:11:00,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 274 transitions, 3120 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-04 17:11:00,236 INFO L231 Difference]: Finished difference. Result has 203 places, 265 transitions, 2712 flow [2024-06-04 17:11:00,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2712, PETRI_PLACES=203, PETRI_TRANSITIONS=265} [2024-06-04 17:11:00,237 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places. [2024-06-04 17:11:00,237 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 265 transitions, 2712 flow [2024-06-04 17:11:00,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 17:11:00,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:00,237 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 17:11:00,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:11:00,238 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:11:00,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:00,238 INFO L85 PathProgramCache]: Analyzing trace with hash -794247438, now seen corresponding path program 2 times [2024-06-04 17:11:00,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:00,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897392757] [2024-06-04 17:11:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:10,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:10,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897392757] [2024-06-04 17:11:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897392757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:10,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:10,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:11:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318653346] [2024-06-04 17:11:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:10,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:11:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:10,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:11:10,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:11:10,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:11:10,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 265 transitions, 2712 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:11:10,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:10,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:11:10,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:11,578 INFO L124 PetriNetUnfolderBase]: 2640/4134 cut-off events. [2024-06-04 17:11:11,578 INFO L125 PetriNetUnfolderBase]: For 324969/324986 co-relation queries the response was YES. [2024-06-04 17:11:11,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32329 conditions, 4134 events. 2640/4134 cut-off events. For 324969/324986 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22590 event pairs, 660 based on Foata normal form. 15/4144 useless extension candidates. Maximal degree in co-relation 32230. Up to 3948 conditions per place. [2024-06-04 17:11:11,621 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 241 selfloop transitions, 43 changer transitions 0/288 dead transitions. [2024-06-04 17:11:11,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 288 transitions, 3793 flow [2024-06-04 17:11:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:11:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:11:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 17:11:11,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37202380952380953 [2024-06-04 17:11:11,624 INFO L175 Difference]: Start difference. First operand has 203 places, 265 transitions, 2712 flow. Second operand 8 states and 125 transitions. [2024-06-04 17:11:11,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 288 transitions, 3793 flow [2024-06-04 17:11:12,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 288 transitions, 3603 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:11:12,081 INFO L231 Difference]: Finished difference. Result has 204 places, 274 transitions, 2842 flow [2024-06-04 17:11:12,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2522, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2842, PETRI_PLACES=204, PETRI_TRANSITIONS=274} [2024-06-04 17:11:12,082 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2024-06-04 17:11:12,082 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 274 transitions, 2842 flow [2024-06-04 17:11:12,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:11:12,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:12,082 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 17:11:12,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:11:12,082 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:11:12,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash 958769375, now seen corresponding path program 4 times [2024-06-04 17:11:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:12,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704365684] [2024-06-04 17:11:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:21,598 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 17:11:21,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:21,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704365684] [2024-06-04 17:11:21,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704365684] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:21,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:21,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:11:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660481972] [2024-06-04 17:11:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:21,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:11:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:21,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:11:21,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:11:21,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:11:21,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 274 transitions, 2842 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:11:21,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:21,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:11:21,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:22,937 INFO L124 PetriNetUnfolderBase]: 2650/4146 cut-off events. [2024-06-04 17:11:22,937 INFO L125 PetriNetUnfolderBase]: For 338647/338659 co-relation queries the response was YES. [2024-06-04 17:11:22,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32722 conditions, 4146 events. 2650/4146 cut-off events. For 338647/338659 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22667 event pairs, 697 based on Foata normal form. 7/4137 useless extension candidates. Maximal degree in co-relation 32622. Up to 3767 conditions per place. [2024-06-04 17:11:22,978 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 207 selfloop transitions, 77 changer transitions 0/288 dead transitions. [2024-06-04 17:11:22,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 288 transitions, 3530 flow [2024-06-04 17:11:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:11:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:11:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-04 17:11:22,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-04 17:11:22,980 INFO L175 Difference]: Start difference. First operand has 204 places, 274 transitions, 2842 flow. Second operand 8 states and 128 transitions. [2024-06-04 17:11:22,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 288 transitions, 3530 flow [2024-06-04 17:11:23,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 288 transitions, 3422 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-06-04 17:11:23,535 INFO L231 Difference]: Finished difference. Result has 209 places, 278 transitions, 2997 flow [2024-06-04 17:11:23,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2734, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2997, PETRI_PLACES=209, PETRI_TRANSITIONS=278} [2024-06-04 17:11:23,535 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places. [2024-06-04 17:11:23,535 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 278 transitions, 2997 flow [2024-06-04 17:11:23,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:11:23,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:23,536 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 17:11:23,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:11:23,536 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 17:11:23,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash 972113418, now seen corresponding path program 3 times [2024-06-04 17:11:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:23,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289467656] [2024-06-04 17:11:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:33,281 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 17:11:33,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:33,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289467656] [2024-06-04 17:11:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289467656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:33,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:33,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:11:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513506690] [2024-06-04 17:11:33,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:33,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:11:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:33,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:11:33,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:11:33,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:11:33,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 278 transitions, 2997 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:11:33,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:33,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:11:33,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:34,745 INFO L124 PetriNetUnfolderBase]: 2652/4145 cut-off events. [2024-06-04 17:11:34,746 INFO L125 PetriNetUnfolderBase]: For 348237/348239 co-relation queries the response was YES. [2024-06-04 17:11:34,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33441 conditions, 4145 events. 2652/4145 cut-off events. For 348237/348239 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22684 event pairs, 719 based on Foata normal form. 2/4145 useless extension candidates. Maximal degree in co-relation 33339. Up to 4009 conditions per place. [2024-06-04 17:11:34,792 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 265 selfloop transitions, 22 changer transitions 0/291 dead transitions. [2024-06-04 17:11:34,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 291 transitions, 3673 flow [2024-06-04 17:11:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:11:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:11:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-04 17:11:34,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-04 17:11:34,794 INFO L175 Difference]: Start difference. First operand has 209 places, 278 transitions, 2997 flow. Second operand 8 states and 120 transitions. [2024-06-04 17:11:34,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 291 transitions, 3673 flow [2024-06-04 17:11:35,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 291 transitions, 3384 flow, removed 70 selfloop flow, removed 6 redundant places. [2024-06-04 17:11:35,299 INFO L231 Difference]: Finished difference. Result has 211 places, 281 transitions, 2843 flow [2024-06-04 17:11:35,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2708, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2843, PETRI_PLACES=211, PETRI_TRANSITIONS=281} [2024-06-04 17:11:35,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 168 predicate places. [2024-06-04 17:11:35,300 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 281 transitions, 2843 flow [2024-06-04 17:11:35,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:11:35,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:35,301 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 17:11:35,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:11:35,301 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 17:11:35,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash 971667545, now seen corresponding path program 5 times [2024-06-04 17:11:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:35,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308506385] [2024-06-04 17:11:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:46,920 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 17:11:46,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:46,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308506385] [2024-06-04 17:11:46,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308506385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:46,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:46,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:11:46,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548918678] [2024-06-04 17:11:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:46,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:11:46,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:46,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:11:46,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:11:47,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:11:47,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 281 transitions, 2843 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:11:47,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:47,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:11:47,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:48,464 INFO L124 PetriNetUnfolderBase]: 2680/4195 cut-off events. [2024-06-04 17:11:48,464 INFO L125 PetriNetUnfolderBase]: For 361496/361509 co-relation queries the response was YES. [2024-06-04 17:11:48,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34043 conditions, 4195 events. 2680/4195 cut-off events. For 361496/361509 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23049 event pairs, 643 based on Foata normal form. 12/4202 useless extension candidates. Maximal degree in co-relation 33940. Up to 3700 conditions per place. [2024-06-04 17:11:48,508 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 208 selfloop transitions, 108 changer transitions 0/320 dead transitions. [2024-06-04 17:11:48,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 320 transitions, 4178 flow [2024-06-04 17:11:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:11:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:11:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-04 17:11:48,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994708994708995 [2024-06-04 17:11:48,510 INFO L175 Difference]: Start difference. First operand has 211 places, 281 transitions, 2843 flow. Second operand 9 states and 151 transitions. [2024-06-04 17:11:48,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 320 transitions, 4178 flow [2024-06-04 17:11:49,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 320 transitions, 4071 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-04 17:11:49,089 INFO L231 Difference]: Finished difference. Result has 216 places, 298 transitions, 3341 flow [2024-06-04 17:11:49,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3341, PETRI_PLACES=216, PETRI_TRANSITIONS=298} [2024-06-04 17:11:49,090 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places. [2024-06-04 17:11:49,090 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 298 transitions, 3341 flow [2024-06-04 17:11:49,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 17:11:49,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:49,091 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 17:11:49,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:11:49,091 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 17:11:49,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:49,091 INFO L85 PathProgramCache]: Analyzing trace with hash 958780535, now seen corresponding path program 6 times [2024-06-04 17:11:49,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:49,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87874176] [2024-06-04 17:11:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:59,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 17:11:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87874176] [2024-06-04 17:11:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87874176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:11:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796715359] [2024-06-04 17:11:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:59,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:11:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:59,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:11:59,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:11:59,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:11:59,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 298 transitions, 3341 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:11:59,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:59,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:11:59,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:00,924 INFO L124 PetriNetUnfolderBase]: 2684/4200 cut-off events. [2024-06-04 17:12:00,924 INFO L125 PetriNetUnfolderBase]: For 374130/374142 co-relation queries the response was YES. [2024-06-04 17:12:00,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35147 conditions, 4200 events. 2684/4200 cut-off events. For 374130/374142 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23016 event pairs, 696 based on Foata normal form. 7/4191 useless extension candidates. Maximal degree in co-relation 35041. Up to 3787 conditions per place. [2024-06-04 17:12:01,060 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 230 selfloop transitions, 81 changer transitions 0/315 dead transitions. [2024-06-04 17:12:01,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 315 transitions, 4285 flow [2024-06-04 17:12:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-04 17:12:01,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3869047619047619 [2024-06-04 17:12:01,074 INFO L175 Difference]: Start difference. First operand has 216 places, 298 transitions, 3341 flow. Second operand 8 states and 130 transitions. [2024-06-04 17:12:01,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 315 transitions, 4285 flow [2024-06-04 17:12:01,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 315 transitions, 4041 flow, removed 77 selfloop flow, removed 4 redundant places. [2024-06-04 17:12:01,661 INFO L231 Difference]: Finished difference. Result has 221 places, 304 transitions, 3454 flow [2024-06-04 17:12:01,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3109, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3454, PETRI_PLACES=221, PETRI_TRANSITIONS=304} [2024-06-04 17:12:01,662 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 178 predicate places. [2024-06-04 17:12:01,662 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 304 transitions, 3454 flow [2024-06-04 17:12:01,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:12:01,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:01,662 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 17:12:01,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:12:01,663 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 17:12:01,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash 958780938, now seen corresponding path program 4 times [2024-06-04 17:12:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:01,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396180862] [2024-06-04 17:12:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:01,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:12,214 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 17:12:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396180862] [2024-06-04 17:12:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396180862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:12,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968013114] [2024-06-04 17:12:12,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:12,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:12,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:12:12,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 304 transitions, 3454 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:12,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:12,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:12:12,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:13,594 INFO L124 PetriNetUnfolderBase]: 2681/4202 cut-off events. [2024-06-04 17:12:13,595 INFO L125 PetriNetUnfolderBase]: For 380227/380244 co-relation queries the response was YES. [2024-06-04 17:12:13,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35070 conditions, 4202 events. 2681/4202 cut-off events. For 380227/380244 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23079 event pairs, 660 based on Foata normal form. 15/4212 useless extension candidates. Maximal degree in co-relation 34961. Up to 4029 conditions per place. [2024-06-04 17:12:13,646 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 286 selfloop transitions, 26 changer transitions 0/316 dead transitions. [2024-06-04 17:12:13,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 316 transitions, 4125 flow [2024-06-04 17:12:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-04 17:12:13,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2024-06-04 17:12:13,648 INFO L175 Difference]: Start difference. First operand has 221 places, 304 transitions, 3454 flow. Second operand 8 states and 128 transitions. [2024-06-04 17:12:13,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 316 transitions, 4125 flow [2024-06-04 17:12:14,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 316 transitions, 3895 flow, removed 72 selfloop flow, removed 4 redundant places. [2024-06-04 17:12:14,328 INFO L231 Difference]: Finished difference. Result has 225 places, 304 transitions, 3282 flow [2024-06-04 17:12:14,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3282, PETRI_PLACES=225, PETRI_TRANSITIONS=304} [2024-06-04 17:12:14,329 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-04 17:12:14,329 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 304 transitions, 3282 flow [2024-06-04 17:12:14,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:14,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:14,330 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 17:12:14,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:12:14,330 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 17:12:14,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash 806151662, now seen corresponding path program 1 times [2024-06-04 17:12:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082985595] [2024-06-04 17:12:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:23,442 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 17:12:23,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082985595] [2024-06-04 17:12:23,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082985595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:23,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:23,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:23,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231671941] [2024-06-04 17:12:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:23,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:23,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:23,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:12:23,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 304 transitions, 3282 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:23,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:23,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:12:23,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:24,954 INFO L124 PetriNetUnfolderBase]: 2595/4105 cut-off events. [2024-06-04 17:12:24,954 INFO L125 PetriNetUnfolderBase]: For 389402/389404 co-relation queries the response was YES. [2024-06-04 17:12:24,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34508 conditions, 4105 events. 2595/4105 cut-off events. For 389402/389404 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22833 event pairs, 683 based on Foata normal form. 1/4104 useless extension candidates. Maximal degree in co-relation 34397. Up to 3816 conditions per place. [2024-06-04 17:12:24,999 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 281 selfloop transitions, 20 changer transitions 0/320 dead transitions. [2024-06-04 17:12:24,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 320 transitions, 3932 flow [2024-06-04 17:12:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:12:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:12:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-04 17:12:25,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2024-06-04 17:12:25,000 INFO L175 Difference]: Start difference. First operand has 225 places, 304 transitions, 3282 flow. Second operand 7 states and 120 transitions. [2024-06-04 17:12:25,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 320 transitions, 3932 flow [2024-06-04 17:12:25,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 320 transitions, 3818 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 17:12:25,474 INFO L231 Difference]: Finished difference. Result has 225 places, 304 transitions, 3218 flow [2024-06-04 17:12:25,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3218, PETRI_PLACES=225, PETRI_TRANSITIONS=304} [2024-06-04 17:12:25,474 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places. [2024-06-04 17:12:25,474 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 304 transitions, 3218 flow [2024-06-04 17:12:25,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:12:25,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:25,475 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 17:12:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:12:25,475 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 17:12:25,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -235333881, now seen corresponding path program 1 times [2024-06-04 17:12:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926687001] [2024-06-04 17:12:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:34,368 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 17:12:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926687001] [2024-06-04 17:12:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926687001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:12:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457725342] [2024-06-04 17:12:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:34,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:12:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:12:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:12:34,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:12:34,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 304 transitions, 3218 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 17:12:34,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:34,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:12:34,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:35,878 INFO L124 PetriNetUnfolderBase]: 2605/4123 cut-off events. [2024-06-04 17:12:35,878 INFO L125 PetriNetUnfolderBase]: For 406900/406902 co-relation queries the response was YES. [2024-06-04 17:12:35,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34762 conditions, 4123 events. 2605/4123 cut-off events. For 406900/406902 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 23008 event pairs, 682 based on Foata normal form. 4/4125 useless extension candidates. Maximal degree in co-relation 34650. Up to 3825 conditions per place. [2024-06-04 17:12:35,941 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 285 selfloop transitions, 21 changer transitions 0/325 dead transitions. [2024-06-04 17:12:35,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 325 transitions, 3932 flow [2024-06-04 17:12:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 17:12:35,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2024-06-04 17:12:35,942 INFO L175 Difference]: Start difference. First operand has 225 places, 304 transitions, 3218 flow. Second operand 8 states and 134 transitions. [2024-06-04 17:12:35,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 325 transitions, 3932 flow [2024-06-04 17:12:36,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 325 transitions, 3882 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:12:36,413 INFO L231 Difference]: Finished difference. Result has 227 places, 307 transitions, 3270 flow [2024-06-04 17:12:36,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3270, PETRI_PLACES=227, PETRI_TRANSITIONS=307} [2024-06-04 17:12:36,413 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 184 predicate places. [2024-06-04 17:12:36,413 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 307 transitions, 3270 flow [2024-06-04 17:12:36,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 17:12:36,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:36,414 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 17:12:36,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:12:36,414 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:12:36,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -231609231, now seen corresponding path program 2 times [2024-06-04 17:12:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930576793] [2024-06-04 17:12:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:45,937 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 17:12:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:45,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930576793] [2024-06-04 17:12:45,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930576793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:45,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:45,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:12:45,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998266811] [2024-06-04 17:12:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:45,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:12:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:45,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:12:45,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:12:46,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:12:46,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 307 transitions, 3270 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 17:12:46,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:46,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:12:46,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:47,447 INFO L124 PetriNetUnfolderBase]: 2645/4181 cut-off events. [2024-06-04 17:12:47,447 INFO L125 PetriNetUnfolderBase]: For 426984/426992 co-relation queries the response was YES. [2024-06-04 17:12:47,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35814 conditions, 4181 events. 2645/4181 cut-off events. For 426984/426992 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23360 event pairs, 683 based on Foata normal form. 5/4184 useless extension candidates. Maximal degree in co-relation 35701. Up to 3876 conditions per place. [2024-06-04 17:12:47,492 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 285 selfloop transitions, 26 changer transitions 0/330 dead transitions. [2024-06-04 17:12:47,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 330 transitions, 4182 flow [2024-06-04 17:12:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 17:12:47,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2024-06-04 17:12:47,493 INFO L175 Difference]: Start difference. First operand has 227 places, 307 transitions, 3270 flow. Second operand 8 states and 134 transitions. [2024-06-04 17:12:47,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 330 transitions, 4182 flow [2024-06-04 17:12:47,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 330 transitions, 4102 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 17:12:47,959 INFO L231 Difference]: Finished difference. Result has 229 places, 314 transitions, 3367 flow [2024-06-04 17:12:47,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3190, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3367, PETRI_PLACES=229, PETRI_TRANSITIONS=314} [2024-06-04 17:12:47,959 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places. [2024-06-04 17:12:47,959 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 314 transitions, 3367 flow [2024-06-04 17:12:47,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 17:12:47,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:47,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:47,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:12:47,960 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:12:47,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash -231614811, now seen corresponding path program 3 times [2024-06-04 17:12:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184894730] [2024-06-04 17:12:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:58,406 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 17:12:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:58,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184894730] [2024-06-04 17:12:58,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184894730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:58,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:58,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:12:58,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203832482] [2024-06-04 17:12:58,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:58,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:12:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:12:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:12:58,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:12:58,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 314 transitions, 3367 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 17:12:58,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:58,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:12:58,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:00,013 INFO L124 PetriNetUnfolderBase]: 2690/4244 cut-off events. [2024-06-04 17:13:00,013 INFO L125 PetriNetUnfolderBase]: For 445697/445699 co-relation queries the response was YES. [2024-06-04 17:13:00,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37158 conditions, 4244 events. 2690/4244 cut-off events. For 445697/445699 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 23724 event pairs, 690 based on Foata normal form. 4/4242 useless extension candidates. Maximal degree in co-relation 37044. Up to 3864 conditions per place. [2024-06-04 17:13:00,062 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 275 selfloop transitions, 44 changer transitions 0/338 dead transitions. [2024-06-04 17:13:00,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 338 transitions, 4321 flow [2024-06-04 17:13:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-04 17:13:00,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2024-06-04 17:13:00,063 INFO L175 Difference]: Start difference. First operand has 229 places, 314 transitions, 3367 flow. Second operand 8 states and 139 transitions. [2024-06-04 17:13:00,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 338 transitions, 4321 flow [2024-06-04 17:13:00,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 338 transitions, 4248 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-04 17:13:00,651 INFO L231 Difference]: Finished difference. Result has 234 places, 320 transitions, 3536 flow [2024-06-04 17:13:00,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3536, PETRI_PLACES=234, PETRI_TRANSITIONS=320} [2024-06-04 17:13:00,651 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 191 predicate places. [2024-06-04 17:13:00,651 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 320 transitions, 3536 flow [2024-06-04 17:13:00,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 17:13:00,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:00,652 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 17:13:00,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:13:00,652 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:13:00,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash 971852243, now seen corresponding path program 4 times [2024-06-04 17:13:00,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:00,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169024096] [2024-06-04 17:13:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169024096] [2024-06-04 17:13:10,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169024096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:10,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:10,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:13:10,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839658337] [2024-06-04 17:13:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:10,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:13:10,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:10,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:13:10,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:13:10,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:13:10,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 320 transitions, 3536 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 17:13:10,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:10,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:13:10,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:12,052 INFO L124 PetriNetUnfolderBase]: 2772/4364 cut-off events. [2024-06-04 17:13:12,053 INFO L125 PetriNetUnfolderBase]: For 485044/485046 co-relation queries the response was YES. [2024-06-04 17:13:12,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39373 conditions, 4364 events. 2772/4364 cut-off events. For 485044/485046 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24384 event pairs, 707 based on Foata normal form. 6/4368 useless extension candidates. Maximal degree in co-relation 39256. Up to 3955 conditions per place. [2024-06-04 17:13:12,106 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 280 selfloop transitions, 52 changer transitions 0/351 dead transitions. [2024-06-04 17:13:12,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 351 transitions, 4762 flow [2024-06-04 17:13:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:13:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:13:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-04 17:13:12,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-04 17:13:12,108 INFO L175 Difference]: Start difference. First operand has 234 places, 320 transitions, 3536 flow. Second operand 9 states and 153 transitions. [2024-06-04 17:13:12,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 351 transitions, 4762 flow [2024-06-04 17:13:12,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 351 transitions, 4680 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-04 17:13:12,626 INFO L231 Difference]: Finished difference. Result has 239 places, 330 transitions, 3770 flow [2024-06-04 17:13:12,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3454, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3770, PETRI_PLACES=239, PETRI_TRANSITIONS=330} [2024-06-04 17:13:12,627 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places. [2024-06-04 17:13:12,627 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 330 transitions, 3770 flow [2024-06-04 17:13:12,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 17:13:12,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:12,627 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 17:13:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:13:12,628 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:13:12,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash 964495013, now seen corresponding path program 5 times [2024-06-04 17:13:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:12,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415811939] [2024-06-04 17:13:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:22,110 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 17:13:22,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:22,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415811939] [2024-06-04 17:13:22,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415811939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:22,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:22,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:22,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46077831] [2024-06-04 17:13:22,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:22,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:22,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:22,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:22,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:22,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:13:22,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 330 transitions, 3770 flow. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:22,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:22,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:13:22,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:23,507 INFO L124 PetriNetUnfolderBase]: 2760/4346 cut-off events. [2024-06-04 17:13:23,507 INFO L125 PetriNetUnfolderBase]: For 484294/484299 co-relation queries the response was YES. [2024-06-04 17:13:23,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39610 conditions, 4346 events. 2760/4346 cut-off events. For 484294/484299 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24288 event pairs, 709 based on Foata normal form. 4/4340 useless extension candidates. Maximal degree in co-relation 39491. Up to 4013 conditions per place. [2024-06-04 17:13:23,562 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 292 selfloop transitions, 35 changer transitions 0/346 dead transitions. [2024-06-04 17:13:23,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 346 transitions, 4534 flow [2024-06-04 17:13:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 17:13:23,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 17:13:23,563 INFO L175 Difference]: Start difference. First operand has 239 places, 330 transitions, 3770 flow. Second operand 8 states and 133 transitions. [2024-06-04 17:13:23,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 346 transitions, 4534 flow [2024-06-04 17:13:24,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 346 transitions, 4421 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-04 17:13:24,209 INFO L231 Difference]: Finished difference. Result has 243 places, 333 transitions, 3811 flow [2024-06-04 17:13:24,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3657, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3811, PETRI_PLACES=243, PETRI_TRANSITIONS=333} [2024-06-04 17:13:24,210 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 200 predicate places. [2024-06-04 17:13:24,210 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 333 transitions, 3811 flow [2024-06-04 17:13:24,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:13:24,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:24,210 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 17:13:24,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:13:24,211 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:13:24,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash 964500593, now seen corresponding path program 6 times [2024-06-04 17:13:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:24,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703824043] [2024-06-04 17:13:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:13:32,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:32,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703824043] [2024-06-04 17:13:32,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703824043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:13:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721090986] [2024-06-04 17:13:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:32,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:13:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:13:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:13:32,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-04 17:13:32,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 333 transitions, 3811 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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 17:13:32,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:32,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-04 17:13:32,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:33,874 INFO L124 PetriNetUnfolderBase]: 2758/4347 cut-off events. [2024-06-04 17:13:33,875 INFO L125 PetriNetUnfolderBase]: For 489829/489837 co-relation queries the response was YES. [2024-06-04 17:13:33,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39559 conditions, 4347 events. 2758/4347 cut-off events. For 489829/489837 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24336 event pairs, 700 based on Foata normal form. 10/4352 useless extension candidates. Maximal degree in co-relation 39438. Up to 4025 conditions per place. [2024-06-04 17:13:33,927 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 302 selfloop transitions, 30 changer transitions 0/351 dead transitions. [2024-06-04 17:13:33,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 351 transitions, 4755 flow [2024-06-04 17:13:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-04 17:13:33,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2024-06-04 17:13:33,929 INFO L175 Difference]: Start difference. First operand has 243 places, 333 transitions, 3811 flow. Second operand 8 states and 134 transitions. [2024-06-04 17:13:33,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 351 transitions, 4755 flow [2024-06-04 17:13:34,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 351 transitions, 4623 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-04 17:13:34,681 INFO L231 Difference]: Finished difference. Result has 245 places, 337 transitions, 3829 flow [2024-06-04 17:13:34,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3679, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3829, PETRI_PLACES=245, PETRI_TRANSITIONS=337} [2024-06-04 17:13:34,682 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 202 predicate places. [2024-06-04 17:13:34,682 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 337 transitions, 3829 flow [2024-06-04 17:13:34,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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 17:13:34,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:34,682 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 17:13:34,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:13:34,683 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:13:34,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 972129290, now seen corresponding path program 1 times [2024-06-04 17:13:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124341113] [2024-06-04 17:13:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:45,643 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 17:13:45,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:45,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124341113] [2024-06-04 17:13:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124341113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:45,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:13:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571099361] [2024-06-04 17:13:45,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:45,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:13:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:45,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:13:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:13:45,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:13:45,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 337 transitions, 3829 flow. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 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 17:13:45,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:45,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:13:45,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:47,226 INFO L124 PetriNetUnfolderBase]: 2875/4463 cut-off events. [2024-06-04 17:13:47,227 INFO L125 PetriNetUnfolderBase]: For 487137/487139 co-relation queries the response was YES. [2024-06-04 17:13:47,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40191 conditions, 4463 events. 2875/4463 cut-off events. For 487137/487139 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24403 event pairs, 740 based on Foata normal form. 2/4463 useless extension candidates. Maximal degree in co-relation 40069. Up to 4323 conditions per place. [2024-06-04 17:13:47,283 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 327 selfloop transitions, 19 changer transitions 0/350 dead transitions. [2024-06-04 17:13:47,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 350 transitions, 4633 flow [2024-06-04 17:13:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-04 17:13:47,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-04 17:13:47,284 INFO L175 Difference]: Start difference. First operand has 245 places, 337 transitions, 3829 flow. Second operand 8 states and 119 transitions. [2024-06-04 17:13:47,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 350 transitions, 4633 flow [2024-06-04 17:13:47,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 350 transitions, 4482 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-04 17:13:47,998 INFO L231 Difference]: Finished difference. Result has 247 places, 339 transitions, 3809 flow [2024-06-04 17:13:47,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3678, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3809, PETRI_PLACES=247, PETRI_TRANSITIONS=339} [2024-06-04 17:13:47,999 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2024-06-04 17:13:47,999 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 339 transitions, 3809 flow [2024-06-04 17:13:47,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 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 17:13:47,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:47,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:47,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:13:47,999 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:13:48,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1782753136, now seen corresponding path program 1 times [2024-06-04 17:13:48,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:48,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883737028] [2024-06-04 17:13:48,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:48,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:57,527 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 17:13:57,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:57,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883737028] [2024-06-04 17:13:57,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883737028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:57,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:57,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:57,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769446333] [2024-06-04 17:13:57,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:57,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:57,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:57,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:57,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:13:57,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 339 transitions, 3809 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:13:57,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:57,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:13:57,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:59,204 INFO L124 PetriNetUnfolderBase]: 2891/4497 cut-off events. [2024-06-04 17:13:59,205 INFO L125 PetriNetUnfolderBase]: For 504718/504732 co-relation queries the response was YES. [2024-06-04 17:13:59,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40444 conditions, 4497 events. 2891/4497 cut-off events. For 504718/504732 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 24706 event pairs, 526 based on Foata normal form. 16/4510 useless extension candidates. Maximal degree in co-relation 40321. Up to 4127 conditions per place. [2024-06-04 17:13:59,261 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 314 selfloop transitions, 51 changer transitions 0/369 dead transitions. [2024-06-04 17:13:59,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 369 transitions, 4732 flow [2024-06-04 17:13:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-04 17:13:59,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2024-06-04 17:13:59,262 INFO L175 Difference]: Start difference. First operand has 247 places, 339 transitions, 3809 flow. Second operand 8 states and 139 transitions. [2024-06-04 17:13:59,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 369 transitions, 4732 flow [2024-06-04 17:13:59,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 369 transitions, 4617 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-04 17:13:59,959 INFO L231 Difference]: Finished difference. Result has 249 places, 342 transitions, 3908 flow [2024-06-04 17:13:59,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3694, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3908, PETRI_PLACES=249, PETRI_TRANSITIONS=342} [2024-06-04 17:13:59,960 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places. [2024-06-04 17:13:59,960 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 342 transitions, 3908 flow [2024-06-04 17:13:59,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:13:59,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:59,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:59,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:13:59,961 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:13:59,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1774182256, now seen corresponding path program 2 times [2024-06-04 17:13:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3852783] [2024-06-04 17:13:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:09,816 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 17:14:09,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:09,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3852783] [2024-06-04 17:14:09,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3852783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087084900] [2024-06-04 17:14:09,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:09,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:09,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:09,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:09,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:14:09,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 342 transitions, 3908 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:14:09,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:09,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:14:09,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:11,485 INFO L124 PetriNetUnfolderBase]: 2907/4521 cut-off events. [2024-06-04 17:14:11,486 INFO L125 PetriNetUnfolderBase]: For 518742/518756 co-relation queries the response was YES. [2024-06-04 17:14:11,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41168 conditions, 4521 events. 2907/4521 cut-off events. For 518742/518756 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 24911 event pairs, 680 based on Foata normal form. 16/4534 useless extension candidates. Maximal degree in co-relation 41044. Up to 4206 conditions per place. [2024-06-04 17:14:11,542 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 312 selfloop transitions, 52 changer transitions 0/368 dead transitions. [2024-06-04 17:14:11,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 368 transitions, 4823 flow [2024-06-04 17:14:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:14:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:14:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-04 17:14:11,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-04 17:14:11,543 INFO L175 Difference]: Start difference. First operand has 249 places, 342 transitions, 3908 flow. Second operand 8 states and 136 transitions. [2024-06-04 17:14:11,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 368 transitions, 4823 flow [2024-06-04 17:14:12,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 368 transitions, 4631 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-06-04 17:14:12,305 INFO L231 Difference]: Finished difference. Result has 251 places, 345 transitions, 3938 flow [2024-06-04 17:14:12,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3716, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3938, PETRI_PLACES=251, PETRI_TRANSITIONS=345} [2024-06-04 17:14:12,305 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places. [2024-06-04 17:14:12,305 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 345 transitions, 3938 flow [2024-06-04 17:14:12,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:14:12,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:12,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:12,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:14:12,306 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:14:12,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1774171344, now seen corresponding path program 1 times [2024-06-04 17:14:12,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:12,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607915150] [2024-06-04 17:14:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:14:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607915150] [2024-06-04 17:14:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607915150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:23,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:23,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:14:23,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860200027] [2024-06-04 17:14:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:23,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:14:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:14:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:14:24,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:14:24,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 345 transitions, 3938 flow. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 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 17:14:24,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:24,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:14:24,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:25,566 INFO L124 PetriNetUnfolderBase]: 2917/4537 cut-off events. [2024-06-04 17:14:25,566 INFO L125 PetriNetUnfolderBase]: For 527225/527239 co-relation queries the response was YES. [2024-06-04 17:14:25,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41494 conditions, 4537 events. 2917/4537 cut-off events. For 527225/527239 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 25023 event pairs, 679 based on Foata normal form. 14/4548 useless extension candidates. Maximal degree in co-relation 41369. Up to 4220 conditions per place. [2024-06-04 17:14:25,617 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 311 selfloop transitions, 57 changer transitions 0/372 dead transitions. [2024-06-04 17:14:25,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 372 transitions, 4881 flow [2024-06-04 17:14:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-06-04 17:14:25,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3941798941798942 [2024-06-04 17:14:25,619 INFO L175 Difference]: Start difference. First operand has 251 places, 345 transitions, 3938 flow. Second operand 9 states and 149 transitions. [2024-06-04 17:14:25,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 372 transitions, 4881 flow [2024-06-04 17:14:26,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 372 transitions, 4681 flow, removed 50 selfloop flow, removed 6 redundant places. [2024-06-04 17:14:26,334 INFO L231 Difference]: Finished difference. Result has 254 places, 349 transitions, 3993 flow [2024-06-04 17:14:26,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3738, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3993, PETRI_PLACES=254, PETRI_TRANSITIONS=349} [2024-06-04 17:14:26,335 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places. [2024-06-04 17:14:26,335 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 349 transitions, 3993 flow [2024-06-04 17:14:26,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 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 17:14:26,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:26,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:26,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:14:26,336 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:14:26,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1664423284, now seen corresponding path program 1 times [2024-06-04 17:14:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:26,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565967922] [2024-06-04 17:14:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:34,631 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 17:14:34,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565967922] [2024-06-04 17:14:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565967922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:34,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066660083] [2024-06-04 17:14:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:34,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:34,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:34,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:34,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:14:34,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 349 transitions, 3993 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:14:34,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:34,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:14:34,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:36,281 INFO L124 PetriNetUnfolderBase]: 2937/4553 cut-off events. [2024-06-04 17:14:36,282 INFO L125 PetriNetUnfolderBase]: For 546238/546243 co-relation queries the response was YES. [2024-06-04 17:14:36,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42106 conditions, 4553 events. 2937/4553 cut-off events. For 546238/546243 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 24966 event pairs, 588 based on Foata normal form. 4/4553 useless extension candidates. Maximal degree in co-relation 41980. Up to 3937 conditions per place. [2024-06-04 17:14:36,337 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 289 selfloop transitions, 95 changer transitions 0/388 dead transitions. [2024-06-04 17:14:36,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 388 transitions, 5033 flow [2024-06-04 17:14:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:14:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:14:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 17:14:36,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2024-06-04 17:14:36,339 INFO L175 Difference]: Start difference. First operand has 254 places, 349 transitions, 3993 flow. Second operand 8 states and 142 transitions. [2024-06-04 17:14:36,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 388 transitions, 5033 flow [2024-06-04 17:14:37,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 388 transitions, 4806 flow, removed 59 selfloop flow, removed 7 redundant places. [2024-06-04 17:14:37,121 INFO L231 Difference]: Finished difference. Result has 256 places, 362 transitions, 4165 flow [2024-06-04 17:14:37,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4165, PETRI_PLACES=256, PETRI_TRANSITIONS=362} [2024-06-04 17:14:37,121 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places. [2024-06-04 17:14:37,121 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 362 transitions, 4165 flow [2024-06-04 17:14:37,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:14:37,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:37,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:37,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:14:37,122 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:14:37,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1664303128, now seen corresponding path program 1 times [2024-06-04 17:14:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:37,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841926129] [2024-06-04 17:14:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:47,003 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 17:14:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841926129] [2024-06-04 17:14:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841926129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:47,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:47,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:14:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581625274] [2024-06-04 17:14:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:47,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:14:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:47,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:14:47,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:14:47,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-06-04 17:14:47,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 362 transitions, 4165 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:14:47,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:47,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-06-04 17:14:47,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:48,704 INFO L124 PetriNetUnfolderBase]: 2947/4568 cut-off events. [2024-06-04 17:14:48,704 INFO L125 PetriNetUnfolderBase]: For 556691/556699 co-relation queries the response was YES. [2024-06-04 17:14:48,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43310 conditions, 4568 events. 2947/4568 cut-off events. For 556691/556699 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25043 event pairs, 617 based on Foata normal form. 6/4571 useless extension candidates. Maximal degree in co-relation 43182. Up to 4264 conditions per place. [2024-06-04 17:14:48,755 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 327 selfloop transitions, 54 changer transitions 0/385 dead transitions. [2024-06-04 17:14:48,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 385 transitions, 5062 flow [2024-06-04 17:14:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:14:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:14:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-04 17:14:48,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 17:14:48,757 INFO L175 Difference]: Start difference. First operand has 256 places, 362 transitions, 4165 flow. Second operand 8 states and 133 transitions. [2024-06-04 17:14:48,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 385 transitions, 5062 flow [2024-06-04 17:14:49,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 385 transitions, 4827 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:49,638 INFO L231 Difference]: Finished difference. Result has 260 places, 366 transitions, 4127 flow [2024-06-04 17:14:49,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3930, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4127, PETRI_PLACES=260, PETRI_TRANSITIONS=366} [2024-06-04 17:14:49,638 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 217 predicate places. [2024-06-04 17:14:49,638 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 366 transitions, 4127 flow [2024-06-04 17:14:49,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 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 17:14:49,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:49,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:49,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:14:49,639 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:14:49,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash -138136088, now seen corresponding path program 2 times [2024-06-04 17:14:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020227045] [2024-06-04 17:14:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15